English
Related papers

Related papers: Strong Completeness of Provability Logic for Ordin…

200 papers

We establish completeness for intuitionistic first-order logic, iFOL, showing that a formula is provable if and only if its embedding into minimal logic, mFOL, is uniformly valid under the Brouwer Heyting Kolmogorov (BHK) semantics, the…

Logic in Computer Science · Computer Science 2016-11-01 Robert Constable , Mark Bickford

Boudou and the authors have recently introduced the intuitionistic temporal logic $\sf ITL^e$ and shown it to be decidable. In this article we show that the `henceforth'-free fragment of this logic is complete for the class of…

Logic · Mathematics 2018-04-11 Martín Diéguez , David Fernández-Duque

We consider the satisfiability problem for the two-variable fragment of first-order logic over finite unranked trees. We work with signatures consisting of some unary predicates and the binary navigational predicates child, right sibling,…

Logic in Computer Science · Computer Science 2014-10-22 Witold Charatonik , Emanuel Kieroński , Filip Mazowiecki

Metric Temporal Logic (MTL) is a generalisation of Linear Temporal Logic in which the Until and Since modalities are annotated with intervals that express metric constraints. A seminal result of Hirshfeld and Rabinovich shows that over the…

Logic in Computer Science · Computer Science 2013-02-19 Paul Hunter , Joël Ouaknine , James Worrell

We prove that the problem of deciding the consequence relation of the full Lambek calculus with weakening is complete for the class HAck of hyper-Ackermannian problems (i.e., level F_{\omega}^{\omega} of the ordinal-indexed hierarchy of…

Logic in Computer Science · Computer Science 2024-06-25 Vitor Greati , Revantha Ramanayake

We investigate algebraic and topological semantics of the modal logic S4CI and obtain strong completeness of the given system in the case of local semantic consequence relations. In addition, we consider an extension of the logic S4CI with…

Logic · Mathematics 2024-06-04 Daniyar Shamkanov

We show that for any $i > 0$, it is decidable, given a regular language, whether it is expressible in the $\Sigma_i[<]$ fragment of first-order logic FO[<]. This settles a question open since 1971. Our main technical result relies on the…

Formal Languages and Automata Theory · Computer Science 2025-02-03 Corentin Barloy , Michaël Cadilhac , Charles Paperman , Howard Straubing

We show a model construction for a system of higher-order illative combinatory logic $\mathcal{I}_\omega$, thus establishing its strong consistency. We also use a variant of this construction to provide a complete embedding of first-order…

Logic · Mathematics 2016-07-12 Łukasz Czajka

There is a polymodal provability logic $GLP$. We consider generalizations of this logic: the logics $GLP_{\alpha}$, where $\alpha$ ranges over linear ordered sets and play the role of the set of indexes of modalities. We consider the…

Logic · Mathematics 2014-12-16 Fedor Pakhomov

In this paper, the class of all linearly ordered topological spaces (LOTS) quasi-ordered by the embeddability relation is investigated. In ZFC it is proved that for countable LOTS this quasi-order has both a maximal (universal) element and…

Logic · Mathematics 2011-02-11 Alex Primavesi , Katherine Thompson

We introduce a very natural topology on the set of total orderings of monomials of any algebra having a countable basis over a field. This topological space and some notable subspaces are compact. This topological framework allows us to…

Rings and Algebras · Mathematics 2011-06-02 Roberto Boldini

Finiteness spaces constitute a categorical model of Linear Logic (LL) whose objects can be seen as linearly topologised spaces, (a class of topological vector spaces introduced by Lefschetz in 1942) and morphisms as continuous linear maps.…

Logic in Computer Science · Computer Science 2009-12-15 Christine Tasson

This paper is devoted to systematic studies of some extensions of first-order G\"odel logic. The first extension is the first-order rational G\"odel logic which is an extension of first-order G\"odel logic, enriched by countably many…

Louveau and Rosendal [5] have shown that the relation of bi-embeddability for countable graphs as well as for many other natural classes of countable structures is complete under Borel reducibility for analytic equivalence relations. This…

Logic · Mathematics 2011-12-05 Sy-David Friedman , Luca Motto Ros

Coalgebras for a functor model different types of transition systems in a uniform way. This paper focuses on a uniform account of finitary logics for set-based coalgebras. In particular, a general construction of a logic from an arbitrary…

Logic in Computer Science · Computer Science 2015-07-01 Alexander Kurz , Jiri Rosicky

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…

Logic in Computer Science · Computer Science 2021-01-26 Emanuel Kieroński , Sebastian Rudolph

Recall that a topological space is said to be a $k_\omega$-space if it is the direct limit of an ascending sequence of compact Hausdorff topological spaces. If each point in a Hausdorff space $X$ has an open neighbourhood which is a…

Group Theory · Mathematics 2017-03-08 Helge Glockner

The topological interpretation of modal logics provides descriptive languages and proof systems for reasoning about points of topological spaces. Recent work has been devoted to model checking of spatial logics on discrete spatial…

Logic in Computer Science · Computer Science 2020-05-13 Vincenzo Ciancia , Diego Latella , Mieke Massink , Erik de Vink

We construct locally Lindel\"of scattered P-spaces (LLSP spaces, in short) with prescribed widths and heights under different set-theoretic assumptions. We prove that there is an LLSP space of width $\omega_1$ and height $\omega_2$ and that…

Logic · Mathematics 2021-11-10 Juan Carlos Martínez , Lajos Soukup

Necessary and sufficient conditions are presented for the (first-order) theory of a universal class of algebraic structures (algebras) to admit a model completion, extending a characterization provided by Wheeler. For varieties of algebras…

Logic · Mathematics 2022-01-05 George Metcalfe , Luca Reggio