Results 1 to 10 of about 1,151,417 (307)
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 +6 more sources
Complexity of validity for propositional dependence logics [PDF]
Electronic Proceedings in Theoretical Computer Science, 2014 We study the validity problem for propositional dependence logic, modal dependence logic and extended modal dependence logic. We show that the validity problem for propositional dependence logic is NEXPTIME-complete.
Jonni Virtema
doaj +4 more sources
A modal logic amalgam of classical and intuitionistic propositional logic [PDF]
Journal of Logic and Computation, 2015 A famous result, conjectured by G\"odel in 1932 and proved by McKinsey and Tarski in 1948, says that $\varphi$ is a theorem of intuitionistic propositional logic IPC iff its G\"odel-translation $\varphi'$ is a theorem of modal logic S4. In this paper, we
Lewitzka, Steffen
core +2 more sources
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 ...
Giorgi Japaridze, Lorenzen P., Turing A.
openaire +5 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
Propositional dynamic logic for searching games with errors [PDF]
Journal of Applied Logic, 2014 We investigate some finitely-valued generalizations of propositional dynamic logic with tests. We start by introducing the (n+1)-valued Kripke models and a corresponding language based on a modal extension of {\L}ukasiewicz many-valued logic.
Bruno Teheux
exaly +4 more sources
From Proof-theoretic Validity to Base-extension Semantics for Intuitionistic Propositional Logic [PDF]
Studia Logica: An International Journal for Symbolic Logic, 2022 Proof-theoretic semantics (P-tS) is the approach to meaning in logic based on proof (as opposed to truth). There are two major approaches to P-tS: proof-theoretic validity (P-tV) and base-extension semantics (B-eS). The former is a semantics of arguments,
A. Gheorghiu, D. Pym
semanticscholar +1 more source
α-Generalized Semantic Resolution Method in Linguistic Truth-valued Propositional Logic P(X) [PDF]
International Journal of Computational Intelligence Systems, 2014 This paper is focused on α-generalized semantic resolution automated reasoning method in linguistic truth-valued lattice-valued propositional logic.
Jiafeng Zhang, Yang Xu, Xingxing He
doaj +1 more source
On Quantified Propositional Logics and the Exponential Time Hierarchy [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 We study quantified propositional logics from the complexity theoretic point of view. First we introduce alternating dependency quantified boolean formulae (ADQBF) which generalize both quantified and dependency quantified boolean formulae.
Miika Hannula +3 more
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