Results 11 to 20 of about 200,339 (137)
The succinctness of first-order logic on linear orders [PDF]
Logical Methods in Computer Science, Volume 1, Issue 1 (June 29,
2005) lmcs:2276, 2005 Succinctness is a natural measure for comparing the strength of different logics. Intuitively, a logic L_1 is more succinct than another logic L_2 if all properties that can be expressed in L_2 can be expressed in L_1 by formulas of (approximately) the same size, but some properties can be expressed in L_1 by (significantly) smaller formulas.
Martin Grohe, Nicole Schweikardt
arxiv +8 more sources
On the Union Closed Fragment of Existential Second-Order Logic and Logics with Team Semantics [PDF]
Logical Methods in Computer Science, Volume 17, Issue 3 (July 30,
2021) lmcs:6501, 2019 We present syntactic characterisations for the union closed fragments of existential second-order logic and of logics with team semantics. Since union closure is a semantical and undecidable property, the normal form we introduce enables the handling and provides a better understanding of this fragment.
Matthias Hoelzel, Richard Wilke
arxiv +7 more sources
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 +3 more sources
Algebraic logic for the negation fragment of classical logic [PDF]
arXiv, 2022 The general aim of this article is to study the negation fragment of classical logic within the framework of contemporary (Abstract) Algebraic Logic. More precisely, we shall find the three classes of algebras that are canonically associated with a logic in Algebraic Logic, that is, we find the classes $\mathrm{Alg}^*$, $\mathrm{Alg}$ and the intrinsic
González, Luciano J.
arxiv +3 more sources
Negational Fragment of Intuitionistic Control Logic [PDF]
arXiv, 2014 We investigate properties of monadic purely negational fragment of Intuitionistic Control Logic (ICL). This logic arises from Intuitionistic Propositional Logic (IPL) by extending language of IPL by additional new constant for falsum. Having two different falsum constants enables to define two forms of negation.
Glenszczyk, Anna
arxiv +6 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
One-dimensional fragment of first-order logic [PDF]
arXiv, 2014 We introduce a novel decidable fragment of first-order logic. The fragment is one-dimensional in the sense that quantification is limited to applications of blocks of existential (universal) quantifiers such that at most one variable remains free in the quantified formula.
Hella, Lauri, Kuusisto, Antti
arxiv +3 more sources
Belief merging within fragments of propositional logic [PDF]
arXiv, 2014 Recently, belief change within the framework of fragments of propositional logic has gained increasing attention. Previous works focused on belief contraction and belief revision on the Horn fragment. However, the problem of belief merging within fragments of propositional logic has been neglected so far.
Creignou, Nadia +3 more
arxiv +3 more sources
Modal meet-implication logic [PDF]
Logical 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
Finite semantics for fragments of intuitionistic logic [PDF]
arXiv, 2019 In 1932, G\"odel proved that there is no finite semantics for intuitionistic logic. We consider all fragments of intuitionistic logic and check in each case whether a finite semantics exists. We may fulfill a didactic goal, as little logic and algebra are presupposed.
Felipe S. Albarelli +1 more
openalex +3 more sources