English
Related papers

Related papers: Full satisfaction classes, definability, and autom…

200 papers

We prove a number of results involving categories enriched over \textsc{CMet}, the category of complete metric spaces with possibly infinite distances. The category \textsc{CPMet} of intrinsic complete metric spaces is locally…

Metric Geometry · Mathematics 2022-05-26 Alexandru Chirvasitu

We study definably complete locally o-minimal expansions of ordered groups in this paper. A definable continuous function defined on a closed, bounded and definable set behave like a continuous function on a compact set. We demonstrate…

Logic · Mathematics 2023-06-09 Masato Fujita

We show, assuming PD, that every complete finitely axiomatized second order theory with a countable model is categorical, but that there is, assuming again PD, a complete recursively axiomatized second order theory with a countable model…

Logic · Mathematics 2024-05-07 Tapio Saarinen , Jouko Väänänen , William Hugh Woodin

For each $n\geq 2$, we show that the class of all finite $n$-dimensional partial orders, when expanded with $n$ linear orders which realize the partial order, forms a Fra\"iss\'e class and identify its Fra\"iss\'e limit…

Combinatorics · Mathematics 2025-01-16 Iian B. Smythe , Mithuna Threz , Max Wiebe

A pointwise definable model is one in which every object is definable without parameters. In a model of set theory, this property strengthens V=HOD, but is not first-order expressible. Nevertheless, if ZFC is consistent, then there are…

Logic · Mathematics 2012-06-20 Joel David Hamkins , David Linetsky , Jonas Reitz

We investigate the concept of definable, or inner, automorphism in the logical setting of partial Horn theories. The central technical result extends a syntactical characterization of the group of such automorphisms (called the covariant…

Logic in Computer Science · Computer Science 2021-02-23 Pieter Hofstra , Jason Parker , Philip J. Scott

We prove that if F is a finitely generated free group and f:F -> F is an automorphism with polynomial growth of degree d, then there exists a characteristic subgroup S < F of finite index such that the induced automorphism of the…

Group Theory · Mathematics 2007-05-23 Adam Piggott

Let $\&$ be a continuous triangular norm on the unit interval $[0,1]$ and $\mathbf{A}$ be a cartesian closed and stable subconstruct of the category consisting of all real-enriched categories. Firstly, it is shown that the category…

Category Theory · Mathematics 2024-08-15 Hongliang Lai , Qingzhu Luo

By operations on models we show how to relate completeness with respect to permissive-nominal models to completeness with respect to nominal models with finite support. Models with finite support are a special case of permissive-nominal…

Logic in Computer Science · Computer Science 2013-05-28 Murdoch J. Gabbay

A class K of finite structures is said to have the extension property for automorphisms (EP) if for every A in K there exists an extension B in K such that every partial isomorphism on the structure A extends to an automorphism of B.…

Logic · Mathematics 2008-02-03 Bernhard Herwig

We show that assuming modest large cardinals, there is a definable class of ordinals, closed and unbounded beneath every uncountable cardinal, so that for any closed and unbounded subclasses $P, Q$, $\langle L[P],\in ,P \rangle$ and…

Logic · Mathematics 2019-03-08 Philip Welch

Let $R\subseteq E$ be two Lie conformal algebras and $Q$ be a given complement of $R$ in $E$. Classifying complements problem asks for describing and classifying all complements of $R$ in $E$ up to an isomorphism. It is known that $E$ is…

Rings and Algebras · Mathematics 2020-10-01 Yanyong Hong

The problem of learning a minimal consistent model from a set of labeled sequences of symbols is addressed from a satisfiability modulo theories perspective. We present two encodings for deterministic finite automata and extend one of these…

Formal Languages and Automata Theory · Computer Science 2017-05-31 Rick Smetsers

We prove that every biregular automorphism of the affine algebraic variety ${\mathbb P}^M\setminus S$, $M\geqslant 3$, where $S\subset {\mathbb P}^M$ is a hypersurface of degree $m\geqslant M+1$ with a unique singular point of multiplicity…

Algebraic Geometry · Mathematics 2018-05-09 Aleksandr V. Pukhlikov

We consider the problem of characterizing isomorphisms of types, or, equivalently, constructive cardinality of sets, in the simultaneous presence of disjoint unions, Cartesian products, and exponentials. Mostly relying on results about…

Logic in Computer Science · Computer Science 2014-11-04 Danko Ilik

We study explorability, a measure of nondeterminism in pushdown automata, which generalises history-determinism. An automaton is k-explorable if, while reading the input, it suffices to follow k concurrent runs, built step-by-step based…

Formal Languages and Automata Theory · Computer Science 2025-11-07 Ayaan Bedi , Karoliina Lehtinen

We prove several theorems relating amenability of groups in various categories (discrete, definable, topological, automorphism group) to model-theoretic invariants (quotients by connected components, Lascar Galois group, G-compactness,…

Logic · Mathematics 2019-01-11 Krzysztof Krupinski , Anand Pillay

We investigate the possible structures imposed on a finite group by its possession of an automorphism sending a large fraction of the group elements to their cubes, the philosophy being that this should force the group to be, in some sense,…

Group Theory · Mathematics 2007-10-24 Peter Hegarty

A completeness conjecture is advanced concerning the free small-colimit completion P(A) of a (possibly large) category A. The conjecture is based on the existence of a small generating-cogenerating set of objects in A. We sketch how the…

Category Theory · Mathematics 2009-09-29 Brian J. Day

We study the automorphism group of the algebraic closure of a substructure A of a pseudo-finite field F. We show that the behavior of this group, even when A is large, depends essentially on the roots of unity in F. For almost all…

Logic · Mathematics 2012-01-16 Özlem Beyarslan , Ehud Hrushovski
‹ Prev 1 3 4 5 6 7 10 Next ›