Results 21 to 30 of about 165,831 (331)
Logic Programming in a Fragment of Intuitionistic Linear Logic [PDF]
Information and Computation, 1994 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hodas, J.S., Miller, D.
openaire +1 more source
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
Capturing relational NEXPTIME with a fragment of existential third order logic
Journal of Computer Science and Technology, 2015 We prove that the existential fragment Σ^(2,ω) 1 of the third order logic TO^ω captures the relational complexity class non deterministic exponential time.
José María Turull Torres
doaj +2 more sources
Merging Fragments of Classical Logic [PDF]
, 2017 We investigate the possibility of extending the non-functionally complete logic of a collection of Boolean connectives by the addition of further Boolean connectives that make the resulting set of connectives functionally complete. More precisely, we will be interested in checking whether an axiomatization for Classical Propositional Logic may be ...
Caleiro, Carlos +2 more
openaire +2 more sources
On density of truth of the intuitionistic logic in one variable [PDF]
Discrete 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
A Fragment of Dependence Logic Capturing Polynomial Time [PDF]
Logical Methods in Computer Science, 2014 In this paper we study the expressive power of Horn-formulae in dependence logic and show that they can express NP-complete problems. Therefore we define an even smaller fragment D-Horn* and show that over finite successor structures it captures the ...
Johannes Ebbing +3 more
doaj +1 more source
Decidable fragments of many-sorted logic [PDF]
Journal of Symbolic Computation, 2007 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Abadi, Aharon +2 more
openaire +2 more sources
Relation-Changing Logics as Fragments of Hybrid Logics [PDF]
Electronic Proceedings in Theoretical Computer Science, 2016 Relation-changing modal logics are extensions of the basic modal logic that allow changes to the accessibility relation of a model during the evaluation of a formula. In particular, they are equipped with dynamic modalities that are able to delete, add, and swap edges in the model, both locally and globally. We provide translations from these logics to
Carlos Areces +3 more
openaire +3 more sources
Finite Model Reasoning in Expressive Fragments of First-Order Logic [PDF]
Electronic Proceedings in Theoretical Computer Science, 2017 Over the past two decades several fragments of first-order logic have been identified and shown to have good computational and algorithmic properties, to a great extent as a result of appropriately describing the image of the standard translation of ...
Lidia Tendera
doaj +1 more source
Decision procedure for a fragment of dynamic logic
Lietuvos Matematikos Rinkinys, 2001 There is not abstract.
Aida Pliuškevičienė
doaj +3 more sources