Results 21 to 30 of about 1,012,276 (331)
Bulletin of the Section of Logic, 2017 We define and investigate from a logical point of view a family of consequence relations defined in probabilistic terms. We call them relations of supporting, and write: |≈w where w is a probability function on a Boolean language. A |≈w B iff the fact that A is the case does not decrease a probability of being B the case.
Jarmużek, Tomasz +2 more
openaire +4 more sources
On Argumentation Logic and Propositional Logic
Studia Logica: An International Journal for Symbolic Logic, 2017 This paper studies the relationship between Argumentation Logic (AL), a recently defined logic based on the study of argumentation in AI, and classical Propositional Logic (PL). In particular, it shows that AL and PL are logically equivalent in that they
A. Kakas, P. Mancarella, Francesca Toni
semanticscholar +1 more source
Propositional computability logic I [PDF]
ACM Transactions on Computational Logic, 2006 In the same sense as classical logic is a formal theory of truth, the recently initiated approach called computability logic is a formal theory of computability. It understands (interactive) computational problems as games played by a machine against the environment, their computability as existence of a machine ...
openaire +4 more sources
A modal logic amalgam of classical and intuitionistic propositional logic [PDF]
Journal of Logic and Computation, 2013 A famous result, conjectured by Godel in 1932 and proved by McKinsey and Tarski in 1948, says that $\varphi$ is a theorem of intuitionistic propositional logic IPC iff its Godel-translation $\varphi'$ is a theorem of modal logic S4.
Steffen Lewitzka
semanticscholar +1 more source
Propositional Logic as a Propositional Fuzzy Logic
Electronic Notes in Theoretical Computer Science, 2006 AbstractThere are several ways to extend the classical logical connectives for fuzzy truth degrees, in such a way that their behavior for the values 0 and 1 work exactly as in the classical one. For each extension of logical connectives the formulas which are always true (the tautologies) changes.
Bedregal, Benjamín René Callejas +1 more
openaire +1 more source
Sequent calculus for propositional likelihood logic
Lietuvos Matematikos Rinkinys, 2023 There is not abstract.
Romas Alonderis
doaj +3 more sources
Super-Łukasiewicz propositional logics [PDF]
Nagoya Mathematical Journal, 1981 In [8] (1920), Łukasiewicz introduced a 3-valued propositional calculus with one designated truth-value and later in [9], Łukasiewicz and Tarski generalized it to an m-valued propositional calculus (where m is a natural number or ) with one designated truth-value.
openaire +3 more sources
Formal Logic for Informal Logicians
Informal Logic, 2008 Classical logic yields counterintuitive results for numerous propositional argument forms. The usual alternatives (modal logic, relevance logic, etc.) generate counterintuitive results of their own. The counterintuitive results create problems—especially
David Sherry
doaj +1 more source
Propositional Logics Complexity and the Sub-Formula Property [PDF]
Electronic Proceedings in Theoretical Computer Science, 2015 In 1979 Richard Statman proved, using proof-theory, that the purely implicational fragment of Intuitionistic Logic (M-imply) is PSPACE-complete.
Edward Hermann Haeusler
doaj +1 more source
Schema Complexity in Propositional-Based Logics
Mathematics, 2021 The essential structure of derivations is used as a tool for measuring the complexity of schema consequences in propositional-based logics. Our schema derivations allow the use of schema lemmas and this is reflected on the schema complexity.
Jaime Ramos +2 more
doaj +1 more source