English
Related papers

Related papers: Tameness for set theory $I$

200 papers

A relevant thesis is that for the family of complete first order theories with NIP (i.e. without the independence property) there is a substantial theory, like the family of stable (and the family of simple) first order theories. We examine…

Logic · Mathematics 2007-05-23 Saharon Shelah

Transfinite set theory including the axiom of choice supplies the following basic theorems: (1) Mappings between infinite sets can always be completed, such that at least one of the sets is exhausted. (2) The real numbers can be well…

General Mathematics · Mathematics 2007-05-23 W. Mueckenheim

This paper deals with formulas of set theory which force the infinity. For such formulas, we provide a technique to infer satisfiability from a finite assignment.

Logic · Mathematics 2016-09-07 Pietro Ursino

The theory of fields that are equipped with a countably infinite family of commuting derivations is not companionable; but if the axiom is added whereby the characteristic of the fields is zero, then the resulting theory is companionable.…

Logic · Mathematics 2013-03-28 Özcan Kasal , David Pierce

We introduce a very natural topology on the set of total orderings of monomials of any algebra having a countable basis over a field. This topological space and some notable subspaces are compact. This topological framework allows us to…

Rings and Algebras · Mathematics 2011-06-02 Roberto Boldini

Let $T$ be a complete theory of fields, possibly with extra structure. Suppose that model-theoretic algebraic closure agrees with field-theoretic algebraic closure, or more generally that model-theoretic algebraic closure has the exchange…

Logic · Mathematics 2023-06-28 Will Johnson , Jinhe Ye

Let $K$ be a field. The \'etale open topology on the $K$-points $V(K)$ of a $K$-variety $V$ was introduced in our previous work. The \'etale open topology is non-discrete if and only if $K$ is large. If $K$ is separably, real, $p$-adically…

Logic · Mathematics 2022-11-22 Erik Walsberg , Jinhe Ye

We show that Shelah's Eventual Categoricity Conjecture follows from the existence of class many strongly compact cardinals. This is the first time the consistency of this conjecture has been proven. We do so by showing that every AEC with…

Logic · Mathematics 2014-05-15 Will Boney

We give sufficient conditions for a first order expansion of the real line to define the standard model of the monadic second order theory of one successor. Such an expansion does not satisfy any of the combinatorial tameness properties…

Logic · Mathematics 2016-12-07 Philipp Hieronymi , Erik Walsberg

We study the Borel-reducibility of isomorphism relations of complete first order theories and show the consistency of the following: For all such theories T and T', if T is classifiable and T' is not, then the isomorphism of models of T' is…

Logic · Mathematics 2016-02-02 Tapani Hyttinen , Vadim Kulikov , Miguel Moreno

A dependent theory is a (first order complete theory) T which does not have the independence property. A main result here is: if we expand a model of T by the traces on it of sets definable in a bigger model then we preserve its being…

Logic · Mathematics 2013-02-20 Saharon Shelah

A topological space $X$ is called resolvable if it contains a dense subset with dense complement. Using only basic principles, we show that whenever the space $X$ has a resolving subset that can be written as an at most countably infinite…

Functional Analysis · Mathematics 2022-08-24 Marcel de Jeu , Jan Harm van der Walt

We prove two completeness results for Kleene algebra with tests and a top element, with respect to guarded string languages and binary relations. While the equational theories of those two classes of models coincide over the signature of…

Formal Languages and Automata Theory · Computer Science 2024-10-09 Damien Pous , Jana Wagemaker

Call a semantics for a language with variables absolute when variables map to fixed entities in the denotation. That is, a semantics is absolute when the denotation of a variable a is a copy of itself in the denotation. We give a trio of…

Logic in Computer Science · Computer Science 2026-04-20 Murdoch J. Gabbay

We deal with (< kappa)-supported iterated forcing notions which are (E_0,E_1)-complete, have in mind problems on Whitehead groups, uniformizations and the general problem. We deal mainly with the successor of a singular case. This continues…

Logic · Mathematics 2016-09-07 Saharon Shelah

A hyperplane arrangement is called formal provided all linear dependencies among the defining forms of the hyperplanes are generated by ones corresponding to intersections of codimension two. The significance of this notion stems from the…

Combinatorics · Mathematics 2024-07-03 Tilman Möller , Paul Mücksch , Gerhard Roehrle

We construct a variety of inner models exhibiting features usually obtained by forcing over universes with large cardinals. For example, if there is a supercompact cardinal, then there is an inner model with a Laver indestructible…

Logic · Mathematics 2011-11-04 Arthur Apter , Victoria Gitman , Joel David Hamkins

Was paper 839 in the author's list until winter 2023 when it was divided into three. Part I: We would like to generalize imaginary elements, weight of ortp$(a,M,N), {\mathbf P}$-weight, ${\mathbf P}$-simple types, etc. from [She90, Ch.…

Logic · Mathematics 2023-04-11 Saharon Shelah

Fiore and Hur recently introduced a conservative extension of universal algebra and equational logic from first to second order. Second-order universal algebra and second-order equational logic respectively provide a model theory and a…

Logic in Computer Science · Computer Science 2013-08-27 Marcelo Fiore , Ola Mahmoud

The theme of the first two sections, is to prepare the framework of how from a ``complicated'' family of so called index models $I \in K_1$ we build many and/or complicated structures in a class $K_2$. The index models are…

Logic · Mathematics 2023-05-19 Saharon Shelah
‹ Prev 1 8 9 10 Next ›