English
Related papers

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

200 papers

It is useful to have a criterion for when the predictions of an operational theory should be considered classically explainable. Here we take the criterion to be that the theory admits of a generalized-noncontextual ontological model.…

Quantum Physics · Physics 2024-03-14 David Schmid , John H. Selby , Matthew F. Pusey , Robert W. Spekkens

In this article we give a classification of the binary, simple, $\omega$-categorical structures with SU-rank 1 and trivial pregeometry. This is done both by showing that they satisfy certain extension properties, but also by noting that…

Logic · Mathematics 2017-04-11 Ove Ahlman

We prove completeness, interpolation and omitting types for certain predicate topological logics that properly extend the first order case. We aslo count the non isomorphic topological models of a countable theory

Logic · Mathematics 2013-04-08 Tarek Sayed Ahmed

The concept of n-categories and related subject is considered. An n-category is described as an n-graph with a composition. A new definition of operad is presented. Some illustrative examples are given.

Category Theory · Mathematics 2007-05-23 Zbigniew Oziewicz , Wladyslaw Marcinek

We develop a family of simple rank one theories built over quite arbitrary sequences of finite hypergraphs. (This extends an idea from the recent proof that Keisler's order has continuum many classes, however, the construction does not…

Logic · Mathematics 2024-07-24 M. Malliaris , S. Shelah

In this paper we consider a type system with a universal type $\omega$ where any term (whether open or closed, $\beta$-normalising or not) has type $\omega$. We provide this type system with a realisability semantics where an atomic type is…

Logic · Mathematics 2009-05-05 Fairouz Kamareddine , Karim Nour

We show that every distributive lattice-ordered pregroup can be embedded into a functional algebra over an integral chain, thus improving the existing Cayley/Holland-style embedding theorem. We use this to show that the variety of all…

Logic · Mathematics 2023-10-23 Nikolaos Galatos , Isis A. Gallardo

We prove that a finite-dimensional omega-categorical group is finite-by-abelian-by-finite and that a finite-dimensional omega-categorical ring is virtually finite-by-null.

Group Theory · Mathematics 2025-11-12 Moreno Invitti

We investigate properties of finite transitive permutation groups $(G, \Omega)$ in which all proper subgroups of $G$ act intransitively on $\Omega.$ In particular, we are interested in reduction theorems for minimally transitive…

Group Theory · Mathematics 2007-05-23 Francesca Dalla Volta , Johannes Siemons

We show that for any type in Martin-L\"of Intensional Type Theory, the terms of that type and its higher identity types form a weak omega-category in the sense of Leinster. Precisely, we construct a contractible globular operad of definable…

Logic · Mathematics 2015-07-01 Peter LeFanu Lumsdaine

Multisorted modules, equivalently representations of quivers, equivalently additive functors on preadditive categories, encompass a wide variety of additive structures. In addition, every module has a natural and useful multisorted…

Representation Theory · Mathematics 2018-08-01 Mike Prest

Working over an arbitrary field, we define compact semisimple 2-categories, and show that every compact semisimple 2-category is equivalent to the 2-category of separable module 1-categories over a finite semisimple tensor 1-category. Then,…

Quantum Algebra · Mathematics 2023-10-27 Thibault D. Décoppet

We present a straightforward embedding of quantified multimodal logic in simple type theory and prove its soundness and completeness. Modal operators are replaced by quantification over a type of possible worlds. We present simple…

Artificial Intelligence · Computer Science 2009-05-18 Christoph Benzmueller , Lawrence C. Paulson

The compactness theorem for a logic states, roughly, that the satisfiability of a set of well-formed formulas can be determined from the satisfiability of its finite subsets, and vice versa. Usually, proofs of this theorem depend on the…

Logic · Mathematics 2025-07-04 Sayantan Roy , Sankha S. Basu , Mihir K. Chakraborty

A first-order structure $\mathfrak{A}$ is called monadically stable iff every expansion of $\mathfrak{A}$ by unary predicates is stable. In this article we give a classification of the class $\mathcal{M}$ of $\omega$-categorical monadically…

Logic · Mathematics 2020-11-18 Bertalan Bodor

Over each nontrivial finite group $G$, there exists a finite system of equations having no solutions in larger finite groups but having a solution in a periodic group containing $G$. We prove several similar facts about amenable, orderable,…

Group Theory · Mathematics 2025-03-04 Alexander Buturlakin , Anton Klyachko , Denis Osin

Classification theory of elementary classes deals with first order (elementary) classes of structures (i.e. fixing a set T of first order sentences, we investigate the class of models of T with the elementary submodel notion). It tries to…

Logic · Mathematics 2009-03-23 Saharon Shelah

It is proven that if $G$ is a finite group, then $G^\omega$ has $2^{\mathfrak c}$ dense nonmeasurable subgroups. Also, other examples of compact groups with dense nonmeasurable subgroups are presented.

General Topology · Mathematics 2014-07-04 F. Javier Trigos-Arrieta

We calculate the possible Scott ranks of countable models of Peano arithmetic. We show that no non-standard model can have Scott rank less than $\omega$ and that non-standard models of true arithmetic must have Scott rank greater than…

Logic · Mathematics 2022-08-04 Antonio Montalbán , Dino Rossegger

It has long been known that every weak monoidal category A is equivalent via monoidal functors and monoidal natural transformations to a strict monoidal category st(A). We generalise the definition of weak monoidal category to give a…

Category Theory · Mathematics 2007-05-23 Miles Gould
‹ Prev 1 4 5 6 7 8 10 Next ›