Results 11 to 20 of about 155,122 (304)
On the Union Closed Fragment of Existential Second-Order Logic and Logics with Team Semantics [PDF]
Logical Methods in Computer Science, 2021 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
Matthias Hoelzel, Richard Wilke
doaj +5 more sources
The succinctness of first-order logic on linear orders [PDF]
Logical Methods in Computer Science, 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 ...
Martin Grohe, Nicole Schweikardt
doaj +6 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
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
Negational Fragment of Intuitionistic Control Logic [PDF]
Studia Logica, 2015 Draft, 22 ...
Glenszczyk, Anna
openaire +9 more sources
Monadic Fragments of Intuitionistic Control Logic [PDF]
Bulletin of the Section of Logic, 2016 We investigate monadic fragments of Intuitionistic Control Logic (ICL), which is obtained from Intuitionistic Propositional Logic (IPL) by extending language of IPL by a constant distinct from intuitionistic constants. In particular we present the complete description of purely negational fragment and show that most of monadic fragments are finite.
Glenszczyk, Anna
openaire +9 more sources
The Complexity of Reasoning for Fragments of Default Logic [PDF]
Journal of Logic and Computation, 2008 Corrected ...
Olaf Beyersdorff +3 more
openalex +8 more sources
Alternating Quantifiers in Uniform One-Dimensional Fragments with an Excursion into Three-Variable Logic [PDF]
Logical Methods in Computer ScienceThe uniform one-dimensional fragment of first-order logic was introduced a few years ago as a generalization of the two-variable fragment to contexts involving relations of arity greater than two.
Oskar Fiuk, Emanuel Kieronski
doaj +2 more sources
The Triguarded Fragment of First-Order Logic
EPiC Series in Computing, 2018 Past research into decidable fragments of first-order logic (FO) has produced two very prominent fragments: the guarded fragment GF, and the two-variable fragment FO2. These fragments are of crucial importance because they provide significant insights into decidabil- ity and expressiveness of other (computational) logics like Modal Logics (MLs) and ...
Sebastian Rudolph, Mantas Šimkus
openalex +3 more sources
Formal systems of fuzzy logic and their fragments
Annals of Pure and Applied Logic, 2007 Abstract Formal systems of fuzzy logic (including the well-known Łukasiewicz and Godel–Dummett infinite-valued logics) are well-established logical systems and respected members of the broad family of the so-called substructural logics closely related to the famous logic BCK. The study of fragments of logical systems is an important issue of research
Petr Cintula +2 more
openalex +4 more sources