Results 1 to 10 of about 1,012,276 (331)

Classical propositional logic and decidability of variables in intuitionistic propositional logic [PDF]

open access: yesLogical 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   +3 more sources

α-Generalized Semantic Resolution Method in Linguistic Truth-valued Propositional Logic P(X) [PDF]

open access: yesInternational 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

Complexity of validity for propositional dependence logics [PDF]

open access: yesElectronic 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   +1 more source

On Quantified Propositional Logics and the Exponential Time Hierarchy [PDF]

open access: yesElectronic 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]

open access: yesLogical 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

Modal meet-implication logic [PDF]

open access: yesLogical Methods in Computer Science, 2022
We extend the meet-implication fragment of propositional intuitionistic logic with a meet-preserving modality. We give semantics based on semilattices and a duality result with a suitable notion of descriptive frame.
Jim de Groot, Dirk Pattinson
doaj   +1 more source

On density of truth of the intuitionistic logic in one variable [PDF]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2008
In this paper we focus on the intuitionistic propositional logic with one propositional variable. More precisely we consider the standard fragment $\{ \to ,\vee ,\bot \}$ of this logic and compute the proportion of tautologies among all formulas.
Zofia Kostrzycka
doaj   +1 more source

Interpolation Property on Visser's Formal Propositional Logic

open access: yesBulletin of the Section of Logic, 2022
In this paper by using a model-theoretic approach, we prove Craig interpolation property for Formal Propositional Logic, FPL, Basic propositional logic, BPL and the uniform left-interpolation property for FPL.
Majid Alizadeh, Masoud Memarzadeh
doaj   +1 more source

Semantics of Propositional Fuzzy Modal Logic with Evaluated Syntax and its Application to Fuzzy Decision Implications [PDF]

open access: yesInternational Journal of Computational Intelligence Systems, 2015
This paper deals with propositional fuzzy modal logic with evaluated syntax based on MV-algebras. We focus on its semantical theory from the viewpoint of Pavelka's graded semantics of propositional fuzzy logic, investigate the L-tautologies based on ...
Xiaodong Pan, Yang Xu
doaj   +1 more source

A Comprehensive Formalization of Propositional Logic in Coq: Deduction Systems, Meta-Theorems, and Automation Tactics

open access: yesMathematics, 2023
The increasing significance of theorem proving-based formalization in mathematics and computer science highlights the necessity for formalizing foundational mathematical theories. In this work, we employ the Coq interactive theorem prover to methodically
Dakai Guo, Wensheng Yu
doaj   +1 more source

Home - About - Disclaimer - Privacy