The first-order theory of raising to an infinite power

2010 ◽  
Vol 43 (1) ◽  
pp. 1-9
Author(s):  
Tom Foster
Keyword(s):  
Order Theory ◽  
First Order ◽  
First Order Theory ◽  
Infinite Power

Kueker's conjecture for superstable theories

1984 ◽  
Vol 49 (3) ◽  
pp. 930-934 ◽  
Author(s):  
Steven Buechler
Keyword(s):  
Order Theory ◽  
First Order ◽  
First Order Theory ◽  
Superstable Theories ◽  
Infinite Power

AbstractWe prove that if every uncountable model of a first-order theory T is ω-saturated and T is superstable then T is categorical in some infinite power.

scholarly journals A first-order theory of Ulm type

Computability ◽  
2019 ◽  
Vol 8 (3-4) ◽  
pp. 347-358
Author(s):  
Matthew Harrison-Trainor
Keyword(s):  
Order Theory ◽  
First Order ◽  
First Order Theory

scholarly journals Quasi-decidability of a Fragment of the First-Order Theory of Real Numbers

2015 ◽  
Vol 57 (2) ◽  
pp. 157-185 ◽  
Author(s):  
Peter Franek ◽  
Stefan Ratschan ◽  
Piotr Zgliczynski
Keyword(s):  
Order Theory ◽  
Real Numbers ◽  
First Order ◽  
First Order Theory

The spectrum of resplendency

1990 ◽  
Vol 55 (2) ◽  
pp. 626-636
Author(s):  
John T. Baldwin
Keyword(s):  
Homogeneous Model ◽  
Order Theory ◽  
First Order ◽  
First Order Theory ◽  
Uncountable Cardinal ◽  
Recursive Theory ◽  
Finite Language

AbstractLet T be a complete countable first order theory and λ an uncountable cardinal. Theorem 1. If T is not superstable, T has 2λ resplendent models of power λ. Theorem 2. If T is strictly superstable, then T has at least min(2λ, ℶ2) resplendent models of power λ. Theorem 3. If T is not superstable or is small and strictly superstable, then every resplendent homogeneous model of T is saturated. Theorem 4 (with Knight). For each μ ∈ ω ∪ {ω, 2ω} there is a recursive theory in a finite language which has μ resplendent models of power κ for every infinite κ.

Sign in / Sign up

Export Citation Format

Share Document