Results 11 to 20 of about 16,840,789 (262)
BH-CIFOL: Case-Intensional First Order Logic: (II) Branching Histories. [PDF]
J Philos Logic, 2014 This is Part I of a two-part essay introducing case-intensional first-order logic (CIFOL), an easy-to-use, uniform, powerful, and useful combination of first order logic with modal logic resulting from philosophical and technical modifications of Bressan’
Belnap N, Müller T.
europepmc +3 more sources
Games and cardinalities in inquisitive first-order logic [PDF]
, 2023 Inquisitive first-order logic, InqBQ, is a system which extends classical first-order logic with formulas expressing questions. From a mathematical point of view, formulas in this logic express properties of sets of relational structures.
Ciardelli, I., Grilletti, G.
core +1 more source
Omitting Types in Fragments and Extensions of First Order Logic
Bulletin of the Section of Logic, 2021 Fix \(2 < n < \omega\). Let \(L_n\) denote first order logic restricted to the first n variables. Using the machinery of algebraic logic, positive and negative results on omitting types are obtained for \(L_n\) and for infinitary variants and extensions ...
Tarek Sayed Ahmed
doaj +1 more source
On the Mints Hierarchy in First-Order Intuitionistic Logic [PDF]
Logical Methods in Computer Science, 2017 We stratify intuitionistic first-order logic over $(\forall,\to)$ into fragments determined by the alternation of positive and negative occurrences of quantifiers (Mints hierarchy). We study the decidability and complexity of these fragments.
Aleksy Schubert +2 more
doaj +1 more source
A first-order logic characterization of safety and co-safety languages [PDF]
Logical Methods in Computer Science, 2023 Linear Temporal Logic (LTL) is one of the most popular temporal logics, that comes into play in a variety of branches of computer science. Among the various reasons of its widespread use there are its strong foundational properties: LTL is equivalent to ...
Alessandro Cimatti +4 more
doaj +1 more source
Geometrisation of first-order logic [PDF]
, 2015 That every first-order theory has a coherent conservative extension is regarded by some as obvious, even trivial, and by others as not at all obvious, but instead remarkable and valuable; the result is in any case neither sufficiently well-known nor ...
Dyckhoff R. +3 more
core +1 more source
First-Order Logic with Connectivity Operators [PDF]
, 2022 First-order logic (FO) can express many algorithmic problems on graphs, such as the independent set and dominating set problem parameterized by solution size.
Siebertz, Sebastian +2 more
core +2 more sources
A First-Order Complete Temporal Logic for Structured Context-Free Languages [PDF]
Logical Methods in Computer Science, 2022 The problem of model checking procedural programs has fostered much research towards the definition of temporal logics for reasoning on context-free structures. The most notable of such results are temporal logics on Nested Words, such as CaRet and NWTL.
Michele Chiari +2 more
doaj +1 more source
Completeness classes for intuitionistic first-order temporal logic with time gaps
Lietuvos Matematikos Rinkinys, 2023 There is not abstract.
Romas Alonderis
doaj +3 more sources
A First Order Logic Definition of Beyond-Planar Graphs
Journal of Graph Algorithms and Applications, 2018 Beyond-planarity is a collective term for classes of graphs that extend the planar graphs and are defined by drawings with restrictions on crossings. Examples are 1-planar, fan-planar, fan-crossing free, and quasi-planar graphs. We define these and other
Franz Brandenburg
doaj +1 more source