English
Related papers

Related papers: A note on Lascar strong types in simple theories

200 papers

We study models M of set theory that are "condensable", in the sense that there is an "ordinal" v of M such that the rank initial segment of M determined by v is both isomorphic to M, and also an elementary submodel of M for infinitary…

Logic · Mathematics 2021-06-21 Ali Enayat

In this paper we consider the set of mu-types, an extension of the set of simple types freely generated from a set of atomic types and the type constructor ->, by a new operator mu, to explicitly denote solutions of recursive equations like…

Logic in Computer Science · Computer Science 2011-02-02 Wil Dekkers

We present an extension of Martin-L\"of Type Theory that contains a tiny object; a type for which there is a right adjoint to the formation of function types as well as the expected left adjoint. We demonstrate the practicality of this type…

Category Theory · Mathematics 2024-03-05 Mitchell Riley

It is known that any rational abstract numeration system is faithfully, and effectively, represented by an N-rational series. A simple proof of this result is given which yields a representation of this series which in turn allows a simple…

Discrete Mathematics · Computer Science 2011-08-30 Pierre-Yves Angrand , Jacques Sakarovitch

I propose a notion of theory motivated by Category theory.

History and Overview · Mathematics 2007-07-26 Andrei Rodin

For tame arbitrary-length toral, also called positive regular, supercuspidal representations of a simply connected and semisimple $p$-adic group $G$, constructed as per Adler-Yu, we determine which components of their restriction to a…

Representation Theory · Mathematics 2021-02-01 Peter Latham , Monica Nevins

A new version of a strong law of large numbers for a ``good'' pairwise independent sequence of random variables (r.v.'s) with a small part of ``bad'' dependent r.v.'s is proposed. The main goal is to relax the assumption on the existence of…

Probability · Mathematics 2025-06-10 I. V. Kozlov , A. Yu. Veretennikov

We prove a dichotomy for $D$-rank 1 types in simple theories that generalizes Buechler's dichotomy for $D$-rank 1 minimal types in stable theories: every $D$-rank 1 type is either 1-based or part of its algebraic closure, defined by a…

Logic · Mathematics 2019-09-20 Ziv Shami

A finite group is said to be weakly separable if every algebraic isomorphism between two $S$-rings over this group is induced by a combinatorial isomorphism. In the paper we prove that every abelian weakly separable group belongs to one of…

Group Theory · Mathematics 2021-11-04 Grigory Ryabov

We present a formal measure of argument strength, which combines the ideas that conclusions of strong arguments are (i) highly probable and (ii) their uncertainty is relatively precise. Likewise, arguments are weak when their conclusion…

Artificial Intelligence · Computer Science 2017-03-10 Niki Pfeifer , Hanna Pankka

We prove a version of Hrushovski's socle lemma for rigid groups in an arbitrary simple theory.

Logic · Mathematics 2013-09-05 Daniel Palacin , Frank Olaf Wagner

In many expert and everyday reasoning contexts it is very useful to reason on the basis of defeasible assumptions. For instance, if the information at hand is incomplete we often use plausible assumptions, or if the information is…

Logic in Computer Science · Computer Science 2018-04-25 AnneMarie Borg

The provability logic of a theory $T$ captures the structural behavior of formalized provability in $T$ as provable in $T$ itself. Like provability, one can formalize the notion of relative interpretability giving rise to interpretability…

Logic · Mathematics 2015-04-01 Evan Goris , Joost J. Joosten

This paper develops a {\em qualitative} and logic-based notion of similarity from the ground up using only elementary concepts of first-order logic centered around the fundamental model-theoretic notion of type.

Logic in Computer Science · Computer Science 2023-05-02 Christian Antić

In this paper, we generalize the basic notions and results of Dempster-Shafer theory from predicates to formal concepts. Results include the representation of conceptual belief functions as inner measures of suitable probability functions,…

Artificial Intelligence · Computer Science 2021-05-19 Sabine Frittella , Krishna Manoorkar , Alessandra Palmigiano , Apostolos Tzimoulis , Nachoem M. Wijnberg

We show, assuming a mild set-theoretic hypothesis, that if an abstract elementary class (AEC) has a superstable-like forking notion for models of cardinality $\lambda$ and a superstable-like forking notion for models of cardinality…

Logic · Mathematics 2020-02-28 Sebastien Vasey

We develop topological dynamics for the group of automorphisms of a monster model of any given theory. In particular, we find strong relationships between objects from topological dynamics (such as the generalized Bohr compactification…

Logic · Mathematics 2025-12-10 Krzysztof Krupiński , Anand Pillay , Tomasz Rzepecki

In this paper we discuss several variations and generalizations of the Cantor set and study some of their properties. Also for each of those generalizations a Cantor-like function can be constructed from the set. We will discuss briefly the…

Classical Analysis and ODEs · Mathematics 2014-03-27 Robert DiMartino , Wilfredo Urbina

We introduce the notion of strong $p$-semi-regularity and show that if $p$ is a regular type which is not locally modular then any $p$-semi-regular type is strongly $p$-semi-regular. Moreover, for any such $p$-semi-regular type, "domination…

Logic · Mathematics 2024-04-16 Elisabeth Bouscaren , Bradd Hart , Ehud Hrushovski , Michael C. Laskowski

Using ideas from synthetic topology, a new approach to descriptive set theory is suggested. Synthetic descriptive set theory promises elegant explanations for various phenomena in both classic and effective descriptive set theory.…

Logic in Computer Science · Computer Science 2014-06-03 Arno Pauly , Matthew de Brecht
‹ Prev 1 8 9 10 Next ›