Buscar
Mostrando ítems 1-10 de 89
A lógica proposicional do 'quase sempre'
(2012)
We introduce, in this paper, a propositional logic to deal with de notion of ‘almost always’. We do this by adding a new operator in classical propositional logic. This new operator captures the same notions of the quantifier ...
Uniqueness Of Axiomatic Extensions Of Cut-free Classical Propositional Logic
(Oxford Univ PressOxford, 2016)
Many-Valued logics and translations
(1999-12-01)
This work presents the concepts of translation and conservative translation between logics. By using algebraic semantics we introduce several conservative translations involving the classical propositional calculus and the ...
An alternative approach for quasi-truth
(Oxford University Press, 2014-04-01)
In 1986, Mikenberg et al. introduced the semantic notion of quasi-truth defined by means of partial structures. In such structures, the predicates are seen as triples of pairwise disjoint sets: the set of tuples which ...
Lost in Translation: Unknowable propositions in probabilistic frameworks
(Springer, 2015-09)
Some propositions are structurally unknowable for certain agents. Let me call them ‘Moorean propositions’. The structural unknowability of Moorean propositions is normally taken to pave the way towards proving a familiar ...
The Semi-Heyting Brouwer Logic
(Springer, 2015-08)
In this paper we introduce a logic that we name semi Heyting–Brouwer logic, SHB, in such a way that the variety of double semi-Heyting algebras is its algebraic counterpart. We prove that, up to equivalences by translations, ...
Reino da natureza, reino dos fins, e proto-reino: um estudo de traduções conservativas
(2014)
We provide conservative translations from propositional modal logic KT (the simplest normal alethic logic) into propositional modal logic KD (the simplest normal deontic logic), and from this into the propositional modal ...
Semi-intuitionistic Logic with Strong Negation
(Springer, 2018-04)
Motivated by the definition of semi-Nelson algebras, a propositional calculus called semi-intuitionistic logic with strong negation is introduced and proved to be complete with respect to that class of algebras. An axiomatic ...
Probabilistic logic with independence
(ELSEVIER SCIENCE INC, 2008)
This paper investigates probabilistic logics endowed with independence relations. We review propositional probabilistic languages without and with independence. We then consider graph-theoretic representations for propositional ...
Completeness in Hybrid Type Theory
(Springer, 2014-05)
We show that basic hybridization (adding nominals and @ operators) makes it possible to give straightforward Henkin-style completeness proofs even when the modal logic being hybridized is higher-order. The key ideas are ...