Results 21 to 30 of about 1,151,417 (307)
Intuitionistic implication makes model checking hard [PDF]
Logical Methods in Computer Science, 2012 We investigate the complexity of the model checking problem for intuitionistic and modal propositional logics over transitive Kripke models. More specific, we consider intuitionistic logic IPC, basic propositional logic BPL, formal propositional logic ...
Martin Mundhenk, Felix Weiss
doaj +1 more source
Annals of Pure and Applied Logic, 2017 We consider team semantics for propositional logic, continuing our previous work (Yang & V\"a\"an\"anen 2016). In team semantics the truth of a propositional formula is considered in a set of valuations, called a team, rather than in an individual valuation.
Yang, F., Väänänen, J.
openaire +5 more sources
Belief Merging within Fragments of Propositional Logic [PDF]
European Conference on Artificial Intelligence, 2014 Recently, belief change within the framework of fragments of propositional logic has gained increasing attention. Previous research focused on belief contraction and belief revision on the Horn fragment.
N. Creignou +3 more
semanticscholar +1 more source
The Propositional Logic of Frege’s Grundgesetze: Semantics and Expressiveness
Journal for the History of Analytical Philosophy, 2017 In this paper we compare the propositional logic of Frege’s Grundgesetze der Arithmetik to modern propositional systems, and show that Frege does not have a separable propositional logic, definable in terms of primitives of Grundgesetze, that corresponds
Eric D. Berg, Roy T. Cook
doaj +1 more source
Unified theory of integral true degrees in NM theory
Xibei Gongye Daxue Xuebao, 2023 Based on the NM propositional logic system of nilpotent minimum logic, the concept of the integral truth degree of the formula is firstly proposed by integrating the function induced by the formula, and the MP rule and HS rule of the integral truth ...
WANG Bo, HUI Xiaojing, LU Xing
doaj +1 more source
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
De Jongh's Theorem for Intuitionistic Zermelo-Fraenkel Set Theory [PDF]
, 2019 We prove that the propositional logic of intuitionistic set theory IZF is intuitionistic propositional logic IPC. More generally, we show that IZF has the de Jongh property with respect to every intermediate logic that is complete with respect to a class
Passmann, Robert
core +3 more sources
Fullness and Decidability in Continuous Propositional Logic
Mathematics, 2022 In this paper we consider general continuous propositional logics and prove some basic properties about them. First, we characterize full systems of continuous connectives of the form {¬,∸,f} where f is a unary connective.
Xuanzhi Ren
doaj +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
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