Results 1 to 10 of about 47,472 (286)
Classical propositional logic and decidability of variables in intuitionistic propositional logic [PDF]
Logical Methods in Computer Science, 2014 We improve the answer to the question: what set of excluded middles for propositional variables in a formula suffices to prove the formula in intuitionistic propositional logic whenever it is provable in classical propositional logic.
Hajime Ishihara
doaj +4 more sources
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 +5 more sources
Initial Solution Generation and Diversified Variable Picking in Local Search for (Weighted) Partial MaxSAT [PDF]
Entropy, 2022 The (weighted) partial maximum satisfiability ((W)PMS) problem is an important generalization of the classic problem of propositional (Boolean) satisfiability with a wide range of real-world applications. In this paper, we propose an initialization and a
Zaijun Zhang +4 more
doaj +2 more sources
Note on Probability of Logical Sentences and the Linda Problem
Analecta Cracoviensia, 2023 This paper presents a logical concept of probability which seems to be obvious, as it is, but the author is not aware of any elaboration of a developed studies on the issue or of any special philosophical application of it.
Adam Olszewski
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
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
Gelfond–Zhang aggregates as propositional formulas [PDF]
Artificial Intelligence, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Pedro Cabalar +3 more
openaire +6 more sources
Characterizing Propositional Proofs as Noncommutative Formulas [PDF]
SIAM Journal on Computing, 2018 Extended abstract appeared in Proc.
Li, Fu, Tzameret, Iddo, Wang, Zhengyu
openaire +3 more sources
A Sound Interpretation of Leśniewski's Epsilon in Modal Logic KTB
Bulletin of the Section of Logic, 2022 In this paper, we shall show that the following translation \(I^M\) from the propositional fragment \(\bf L_1\) of Leśniewski's ontology to modal logic \(\bf KTB\) is sound: for any formula \(\phi\) and \(\psi\) of \(\bf L_1\), it is defined as (M1 ...
Takao Inoue
doaj +1 more source
On the Succinctness of Atoms of Dependency [PDF]
Logical Methods in Computer Science, 2019 Propositional team logic is the propositional analog to first-order team logic. Non-classical atoms of dependence, independence, inclusion, exclusion and anonymity can be expressed in it, but for all atoms except dependence only exponential translations ...
Martin Lück, Miikka Vilander
doaj +1 more source