Results 71 to 80 of about 200,339 (137)
Finite Model Theory of the Triguarded Fragment and Related Logics [PDF]
arXiv, 2021 The Triguarded Fragment (TGF) is among the most expressive decidable fragments of first-order logic, subsuming both its two-variable and guarded fragments without equality. We show that the TGF has the finite model property (providing a tight doubly exponential bound on the model size) and hence finite satisfiability coincides with satisfiability known
arxiv
The Pebble-Relation Comonad in Finite Model Theory [PDF]
Logical Methods in Computer ScienceThe pebbling comonad, introduced by Abramsky, Dawar and Wang, provides a categorical interpretation for the k-pebble games from finite model theory.
Yoàv Montacute, Nihil Shah
doaj +1 more source
On the Limits of Decision: the Adjacent Fragment of First-Order Logic [PDF]
arXiv, 2023 We define the adjacent fragment AF of first-order logic, obtained by restricting the sequences of variables occurring as arguments in atomic formulas. The adjacent fragment generalizes (after a routine renaming) two-variable logic as well as the fluted fragment.
arxiv
Sequent Calculi for the classical fragment of Bochvar and Halldén's Nonsense Logics [PDF]
Electronic Proceedings in Theoretical Computer Science, 2013 In this paper sequent calculi for the classical fragment (that is, the conjunction-disjunction-implication-negation fragment) of the nonsense logics B3, introduced by Bochvar, and H3, introduced by Halldén, are presented.
Marcelo E. Coniglio, María I. Corbalán
doaj +1 more source
A Criticism of Kripke’s Semantic for Intuitionistic Logic
O Que Nos Faz Pensar, 2016 This note aims to examine critically Kripke’s semantics for propositional intuitionistic logic. Kripke’s semantic is extensionally correct with respect to propositional intuitionistic logic, that is, the calculus is sound and complete with respect to the
Wagner de Campos Sanz
doaj
Two Variable vs. Linear Temporal Logic in Model Checking and Games [PDF]
Logical Methods in Computer Science, 2013 Model checking linear-time properties expressed in first-order logic has non-elementary complexity, and thus various restricted logical languages are employed. In this paper we consider two such restricted specification logics, linear temporal logic (LTL)
Michael Benedikt +2 more
doaj +1 more source
Craig Interpolation for Guarded Fragments [PDF]
arXiv, 2023 We show that the guarded-negation fragment (GNFO) is, in a precise sense, the smallest extension of the guarded fragment (GFO) with Craig interpolation. In contrast, %we show that the smallest extension of the two-variable fragment (FO2) with Craig interpolation is full first-order logic.
arxiv
Intersection Logic in sequent calculus style [PDF]
Electronic Proceedings in Theoretical Computer Science, 2011 The intersection type assignment system has been designed directly as deductive system for assigning formulae of the implicative and conjunctive fragment of the intuitionistic logic to terms of lambda-calculus.
Simona Ronchi Della Rocca +3 more
doaj +1 more source
Hierarchies in Dependence Logic [PDF]
arXiv, 2011 We study fragments of dependence logic defined either by restricting the number k of universal quantifiers or the width of dependence atoms in formulas. We find the sublogics of existential second-order logic corresponding to these fragments of dependence logic.
arxiv
Logics with rigidly guarded data tests [PDF]
Logical Methods in Computer Science, 2015 The notion of orbit finite data monoid was recently introduced by Bojanczyk as an algebraic object for defining recognizable languages of data words.
Gabriele Puppis +2 more
doaj +1 more source