English
Related papers

Related papers: On many-sorted $\omega$-categorical theories

200 papers

Simple type theory is suited as framework for combining classical and non-classical logics. This claim is based on the observation that various prominent logics, including (quantified) multimodal logics and intuitionistic logics, can be…

Logic in Computer Science · Computer Science 2015-03-17 Christoph Benzmueller

We give a new simple proof of the decidability of the First Order Theory of (omega^omega^i,+) and the Monadic Second Order Theory of (omega^i,<), improving the complexity in both cases. Our algorithm is based on tree automata and a new…

Computer Science and Game Theory · Computer Science 2007-05-23 Thierry Cachat

The structures $\langle M,\subseteq^M\rangle$ arising as the inclusion relation of a countable model of sufficient set theory $\langle M,\in^M\rangle$, whether well-founded or not, are all isomorphic. These structures $\langle…

Logic · Mathematics 2017-04-17 Joel David Hamkins , Makoto Kikuchi

We present a simpler way than usual to deduce the completeness theorem for the second-oder classical logic from the first-order one. We also extend our method to the case of second-order intuitionistic logic.

Logic · Mathematics 2009-05-07 Karim Nour , Christophe Raffalli

The representation theory for categorical groups is constructed. Each categorical group determines a monoidal bicategory of representations. Typically, these categories contain representations which are indecomposable but not irreducible. A…

Category Theory · Mathematics 2007-05-23 John W. Barrett , Marco Mackaay

Let a finite non-empty X is equipped with discrete topology. We prove that S \subseteq X^\omega is of second category if and only if for each f:\omega -> \bigcup_{n \in \omega} X^n there exists a sequence {a_n}_{n \in \omega} belonging to S…

Logic · Mathematics 2007-05-23 Apoloniusz Tyszka

A certain amount of category theory is developed in an arbitrary finitely complete category with a factorization system on it, playing the role of the comprehensive factorization system on Cat. Those aspects related to the concepts of…

Category Theory · Mathematics 2007-09-07 Claudio Pisani

It is known that a countable $\omega$-categorical structure interprets all finite structures primitively positively if and only if its polymorphism clone maps to the clone of projections on a two-element set via a continuous clone…

Logic · Mathematics 2023-06-22 Manuel Bodirsky , Michael Pinsker , András Pongrácz

Let G be a simple complex algebraic group. By using a notion of a G-category we define invariants of tangles with flat G-connections in their complements. We also show that quantized universal enveloping algebras at roots of unity provide…

Quantum Algebra · Mathematics 2010-08-10 R. Kashaev , N. Reshetikhin

We give a full solution to the question of existence of indiscernibles in dependent theories by proving the following theorem: for every $\theta$ there is a dependent theory $T$ of size $\theta$ such that for all $\kappa$ and $\delta$,…

Logic · Mathematics 2013-08-29 Itay Kaplan , Saharon Shelah

We identify a number of decidable and undecidable fragments of first-order concatenation theory. We also give a purely universal axiomatization which is complete for the fragments we identify. Furthermore, we prove some normal-form results.

Logic · Mathematics 2018-04-18 Lars Kristiansen , Juvenal Murwanashyaka

In this work, we analyze the structure of the category of partial representations of a finite group $G$ as a multifusion category, providing an alternative way to describe simple objects and their tensor products. We describe the…

Representation Theory · Mathematics 2026-02-16 Arthur R. Alves Neto , Eliezer Batista , Javier Méndez

We prove a reconstruction theorem valid for arbitrary theories in continuous (or classical) logic in a countable language, that is to say that we provide a complete bi-interpretation invariant for such theories, taking the form of an open…

Logic · Mathematics 2023-11-08 Itaï Ben Yaacov

We prove that, for every theory $T$ which is given by an ${\mathcal L}_{\omega_1,\omega}$ sentence, $T$ has less than $2^{\aleph_0}$ many countable models if and only if we have that, for every $X\in 2^\omega$ on a cone of Turing degrees,…

Logic · Mathematics 2013-06-07 Antonio Montalban

Let $T$ be a complete, superstable theory with fewer than $2^{\aleph_{0}}$ countable models. Assuming that generic types of infinite, simple groups definable in $T^{eq}$ are sufficiently non-isolated we prove that $\omega^{\omega}$ is the…

Logic · Mathematics 2015-03-17 Predrag Tanović

We deal with the monadic (second-order) theory of order. We prove all known results in a unified way, show a general way of reduction, prove more results and show the limitation on extending them. We prove (CH) that the monadic theory of…

Logic · Mathematics 2023-05-02 Saharon Shelah

It is known that a category of many-sorted algebras on pure sets of similarity type is "concretely equivalent" to a category of single-sorted algebras. In this paper, we characterize a single-sorted variety that corresponds to a many-sorted…

Logic · Mathematics 2013-11-06 Shohei Izawa

Answering some of the main questions from [MR13], we show that whenever $\kappa$ is a cardinal satisfying $\kappa^{< \kappa} = \kappa > \omega$, then the embeddability relation between $\kappa$-sized structures is strongly invariantly…

Logic · Mathematics 2021-02-18 Filippo Calderoni , Heike Mildenberger , Luca Motto Ros

It is well known that many-sorted logic can be reduced to unsorted first-order logic by adding predicates for each sort, relativizing quantifiers to these predicates, and adding appropriate axioms governing their behavior. Existing…

Logic · Mathematics 2026-05-19 Hrafn Valtýr Oddsson

We prove that if $T$ is an $\omega$-categorical supersimple theory with nontrivial dependence (given by forking), then there is a nontrivial regular 1-type over a finite set of reals which is realized by real elements; hence forking induces…

Logic · Mathematics 2018-07-02 Vera Koponen