Results 11 to 20 of about 16,441 (253)
A Real-Valued Modal Logic [PDF]
Logical Methods in Computer Science, 2018 A many-valued modal logic is introduced that combines the usual Kripke frame semantics of the modal logic K with connectives interpreted locally at worlds by lattice and group operations over the real numbers.
Denisa Diaconescu +2 more
doaj +1 more source
Making first order linear logic a generating grammar [PDF]
Logical Methods in Computer Science, 2023 It is known that different categorial grammars have surface representation in a fragment of first order multiplicative linear logic (MLL1). We show that the fragment of interest is equivalent to the recently introduced extended tensor type calculus (ETTC)
Sergey Slavnov
doaj +1 more source
Multiplicative-Additive Proof Equivalence is Logspace-complete, via Binary Decision Trees [PDF]
Logical Methods in Computer Science, 2017 Given a logic presented in a sequent calculus, a natural question is that of equivalence of proofs: to determine whether two given proofs are equated by any denotational semantics, ie any categorical interpretation of the logic compatible with its cut ...
Marc Bagnol
doaj +1 more source
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
Logic Programming in a Fragment of Intuitionistic Linear Logic [PDF]
Information and Computation, 1994 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Joshua S. Hodas, Dale Miller 0001
openaire +2 more sources
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
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 +1 more source
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 ...
Carlos Caleiro +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