Buscar
Mostrando ítems 1-10 de 48
Independence friendly logic with classical negation via flattening is a second-order logic with weak dependencies
(Elsevier Inc, 2014-04)
It is well-known that Independence Friendly (IF) logic is equivalent to existential secondorder logic (Σ1 1 ) and, therefore, is not closed under classical negation. The Boolean closure of IF sentences, called Extended ...
Defining LFIs and LFUs in extensions of infectious logics
(Taylor & Francis, 2016-10)
The aim of this paper is to explore the peculiar case of infectious logics, a group of systems obtained generalizing the semantic behavior characteristic of the (¬, ∧, ∨) -fragment of the logics of nonsense, such as the ...
Hilbert calculi for the main fragments of Classical LogicCálculos de Hilbert para os principais fragmentos da Lógica Clássica
(Universidade Federal do Rio Grande do NorteBrasilUFRNCiência da Computação, 2019)
Algebraic semantics and calculi for Nelson's logics
(Universidade Federal do Rio Grande do NorteBrasilUFRNPROGRAMA DE PÓS-GRADUAÇÃO EM SISTEMAS E COMPUTAÇÃO, 2022-02-18)
The aim of this thesis is to study a family of logics, comprised of Nelson’s logic S, constructive logic with strong negation N 3, quasi-Nelson logic QN and quasi-Nelson implicative
logic QN I. This is done in two ways. ...
Extração automática de cálculos de Hilbert associados aos fragmentos da lógica clássicaAutomatic extraction of Hilbert Calculi associated to fragments of classical logic
(Universidade Federal do Rio Grande do NorteBrasilUFRNBacharelado em Ciência da Computação, 2019)
On the formal semantics of IF-like logics
(Elsevier Inc, 2010-08)
In classical logics, the meaning of a formula is invariant with respect to the renaming of bound variables. This property, normally taken for granted, has been shown not to hold in the case of Independence Friendly (IF) ...
Cálculo de tableaux para fórmulas elementales en lógicas de separación
(2020)
En este trabajo final investigamos métodos computacionales de razonamiento para lenguajes modales dinámicos. Por lenguajes dinámicos nos referimos a formalismos que permitan cambiar la estructura subyacente a medida que ...
Generalized abstract argumentation: Handling arguments in FOL fragments
(Springer, 2009-06)
Generalized argumentation frameworks relate formulae in classical logic to arguments based on the Dung's classic framework. The main purpose of the generalization is to provide a theory capable of reasoning (following ...
Especificação de sistemas utilizando lógica linear com subexponencias
(Universidade Federal de Minas GeraisUFMG, 2010-11-17)
Logic programming is defined as the use of logic formulas representing programs and proof search of these formulas as the execution of the program (computation). This is an interesting paradigm because of the specifications' ...
Relation-changing modal operators
(Oxford University Press, 2015-05)
We study dynamic modal operators that can change the accessibility relation of a model during the evaluation of a formula. In particular, we extend the basic modal language with modalities that are able to delete, add or ...