:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Lefever, Koen, Székely, Gergely
Format:	Preprint
Published:	2025
Subjects:	Logic
Online Access:	https://arxiv.org/abs/2501.16633
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Definable coordinate geometries over fields, part 1: theory
by: Madarász, Judit, et al.
Published: (2025)

Definable coordinate geometries over fields, part 2: applications
by: Madarász, Judit, et al.
Published: (2025)

One-variable fragments of first-order logics
by: Cintula, Petr, et al.
Published: (2023)

On first-order model checking parameterized by the number of variables
by: Jedelský, Jan
Published: (2026)

Abstract computation over first-order structures. Part IIa: Moschovakis' operator and other non-determinisms
by: Gaßner, Christine
Published: (2025)

Abstract computation over first-order structures. Part IIb: Moschovakis' operator and other non-determinisms
by: Gaßner, Christine
Published: (2025)

Abstract computation over first-order structures. Part I: Deterministic and non-deterministic BSS RAMs
by: Gaßner, Christine
Published: (2025)

On semantics of first-order justification logic with binding modalities
by: Yavorskaya, Tatiana, et al.
Published: (2025)

On first-order transductions of classes of graphs
by: Braunfeld, Samuel, et al.
Published: (2022)

On the expressive power of inquisitive team logic and inquisitive first-order logic
by: Kontinen, Juha, et al.
Published: (2026)

Definiteness properties of first-order schemes
by: Gruza, Piotr, et al.
Published: (2025)

Sequent calculi for first-order ST
by: Paoli, Francesco, et al.
Published: (2026)

The failure of cut-elimination in cyclic proof for first-order logic with inductive definitions
by: Oda, Yukihiro, et al.
Published: (2021)

Making first order linear logic a generating grammar
by: Slavnov, Sergey
Published: (2022)

A very sharp threshold for first order logic distinguishability of random graphs
by: Benjamini, Itai, et al.
Published: (2022)

Proofs as stateful programs: A first-order logic with abstract Hoare triples, and an interpretation into an imperative language
by: Powell, Thomas
Published: (2023)

Characterizations of monadically dependent tree-ordered weakly sparse structures
by: Buffière, Hector, et al.
Published: (2026)

Elementary first-order model checking for sparse graphs
by: Gajarský, Jakub, et al.
Published: (2024)

Conciseness of first-order formulae
by: Conte, Martina, et al.
Published: (2025)

On the first order theory of plactic monoids
by: Turaev, Daniel
Published: (2023)

On classification of continuous first order theories
by: Khanaki, Karim
Published: (2022)

On the first-order theory of the remainder
by: Prunescu, Mihai
Published: (2025)

New foundations of reasoning via real-valued first-order logics
by: Badia, Guillermo, et al.
Published: (2022)

A Walk on the Wild Side: Notions of maximality in first-order theories
by: Bailetti, Michele
Published: (2024)

Inquisitive first-order logic is neither compact nor recursively axiomatizable
by: Ciardelli, Ivano, et al.
Published: (2026)

On first-order definable operations on relational structures
by: Courcelle, Bruno
Published: (2026)

Sequential discontinuity and first-order problems
by: Pauly, Arno, et al.
Published: (2024)

An abstract fixed-point theorem for Horn formula equations
by: Hetzl, Stefan, et al.
Published: (2025)

Boolean basis, formula size, and number of modal operators
by: Berkholz, Christoph, et al.
Published: (2024)

Low-like basis theorems for Ramsey's theorem for pairs in first-order arithmetic
by: Ikari, Hiroyuki, et al.
Published: (2026)

Gelfand-Kirillov conjecture as a first-order formula
by: Mariano, Hugo Luiz, et al.
Published: (2020)

Stable first order theories as simplicial profinite sets
by: Gavrilovich, Misha
Published: (2025)

Synthesis for prefix first-order logic on data words
by: Grange, Julien, et al.
Published: (2024)

Semantics out of context: nominal absolute denotations for first-order logic and computation
by: Gabbay, Murdoch J.
Published: (2013)

Constant time testability of first-order logic with modulo counting on finitary graphs
by: Adler, Isolde, et al.
Published: (2026)

Local and global $d$-rigidity are not definable in the first order logic of graphs
by: Bernstein, Daniel Irving, et al.
Published: (2025)

On first order amenability
by: Hrushovski, Ehud, et al.
Published: (2020)

Hardness of monadic second-order formulae over succinct graphs
by: Gamard, Guilhem, et al.
Published: (2023)

Forcing and Interpolation in first-order hybrid Logic with rigid symbols
by: Găină, Daniel, et al.
Published: (2026)

Complexity of the variable-free fragments of non-normal modal logics (extended version)
by: Kudinov, A., et al.
Published: (2025)