English
Related papers

Related papers: When does every definable nonempty set have a defi…

200 papers

Every bounded definable open set is a union of finitely many open strong cells in a weakly o-minimal expansion of a real closed field. We prove this fact and another theorem similar to it.

Logic · Mathematics 2026-02-23 Tomohiro Kawakami , Hiroshi Tanaka

A subset of a topological space is constructible if it is a finite Boolean combination of closed sets. We prove that every NTP$_2$ expansion of $(\mathbb{R},<,+)$ by constructible sets defines only constructible sets, and that definable…

Logic · Mathematics 2026-05-20 Pablo Andújar Guerrero

The standard treatment of sets and definable classes in first-order Zermelo-Fraenkel set theory accords in many respects with the Fregean foundational framework, such as the distinction between objects and concepts. Nevertheless, in set…

Logic · Mathematics 2022-09-19 Joel David Hamkins

Let $Z_2$, $Z_3$, and $Z_4$ denote $2^{\rm nd}$, $3^{\rm rd}$, and $4^{\rm th}$ order arithmetic, respectively. We let Harrington's Principle, {\sf HP}, denote the statement that there is a real $x$ such that every $x$--admissible ordinal…

Logic · Mathematics 2020-12-22 Yong Cheng , Ralf Schindler

While modal extensions of decidable fragments of first-order logic are usually undecidable, their monodic counterparts, in which formulas in the scope of modal operators have at most one free variable, are typically decidable. This only…

Logic in Computer Science · Computer Science 2025-09-11 Alessandro Artale , Christopher Hampson , Roman Kontchakov , Andrea Mazzullo , Frank Wolter

Given a subset of $X\subseteq \mathbb{R}^{n}$ we can associate with every point $x\in \mathbb{R}^{n}$ a vector space $V$ of maximal dimension with the property that for some ball centered at $x$, the subset $X$ coincides inside the ball…

Logic · Mathematics 2023-06-22 Alexis Bès , Christian Choffrut

We investigate the decidability of the definability problem for fragments of first order logic over finite words enriched with modular predicates. Our approach aims toward the most generic statements that we could achieve, which…

Logic in Computer Science · Computer Science 2015-11-16 Luc Dartois , Charles Paperman

This is the second in a series of papers on the relation between algebraic set theory and predicative formal systems. In part I, we introduced the notion of a predicative category of small maps and obtained the result that such categories…

Logic · Mathematics 2008-01-16 Benno van den Berg , Ieke Moerdijk

We prove that in a semi-bounded o-minimal expansion of an ordered group every non-empty open definable set is a finite union of open cells.

Logic · Mathematics 2015-07-17 Mário J. Edmundo , Pantelis Eleftheriou , Luca Prelli

Recently, symbolic structures were proposed as finite representations of potentially infinite first-order structures, where Linear Integer Arithmetic terms and formulas define the domain and interpretations of a structure. We generalize…

Logic in Computer Science · Computer Science 2026-05-14 Neta Elad , Sharon Shoham

We develop a general ring theory in the o-minimal setting culminating in a description of all the definable rings in an arbitrary o-minimal structure. We show that every definably connected ring with non-trivial multiplication defines an…

Logic · Mathematics 2025-03-05 Annalisa Conversano

Propositional term modal logic is interpreted over Kripke structures with unboundedly many accessibility relations and hence the syntax admits variables indexing modalities and quantification over them. This logic is undecidable, and we…

Logic in Computer Science · Computer Science 2019-01-01 Anantha Padmanabha , R Ramanujam

Decomposable ordered structures were introduced in \cite{OnSt} to develop a general framework to study `finite-dimensional' totally ordered structures. This paper continues this work to include decomposable structures on which a ordered…

Logic · Mathematics 2014-02-27 Eliana Barriga , Alf Onshuus , Charles Steinhorn

The study of Description Logics have been historically mostly focused on features that can be translated to decidable fragments of first-order logic. In this paper, we leave this restriction behind and look for useful and decidable…

Logic in Computer Science · Computer Science 2023-08-30 Joshua Hirschbrunn , Yevgeny Kazakov

We continue the analysis of definably compact groups definable in a real closed field $\mathcal{R}$. In [3], we proved that for every definably compact definably connected semialgebraic group $G$ over $\mathcal{R}$ there are a connected…

Logic · Mathematics 2017-05-23 Eliana Barriga

We study orbit-finite systems of linear equations, in the setting of sets with atoms. Our principal contribution is a decision procedure for solvability of such systems. The procedure works for every field (and even commutative ring) under…

Computation and Language · Computer Science 2024-02-28 Arka Ghosh , Piotr Hofman , Sławomir Lasota

Definite descriptions, such as 'the General Chair of KR 2024', are a semantically transparent device for object identification in knowledge representation. In first-order modal logic, definite descriptions have been widely investigated for…

Logic in Computer Science · Computer Science 2024-09-12 Alessandro Artale , Roman Kontchakov , Andrea Mazzullo , Frank Wolter

We introduce the notion of a definable category--a category equivalent to a full subcategory of a locally finitely presentable category that is closed under products, directed colimits and pure subobjects. Definable subcategories are…

Category Theory · Mathematics 2016-12-13 Amit Kuber , Jiří Rosický

Let $\mathcal{R}$ be an $\mathrm{NIP}$ expansion of $(\mathbb{R},<,+)$ by closed subsets of $\mathbb{R}^n$ and continuous functions $f : \mathbb{R}^m \to \mathbb{R}^n$. Then $\mathcal{R}$ is generically locally o-minimal. It follows that if…

Logic · Mathematics 2020-03-30 Erik Walsberg

Independence of premise principles play an important role in characterizing the modified realizability and the Dialectica interpretations. In this paper we show that a great many intuitionistic set theories are closed under the…

Logic · Mathematics 2019-11-20 Takako Nemoto , Michael Rathjen
‹ Prev 1 3 4 5 6 7 10 Next ›