New set-theoretic axioms derived from a lean metamathematics

1995 ◽  
Vol 60 (1) ◽  
pp. 191-198 ◽  
Author(s):  
Jan Mycielski

I will formulate in this paper three set-theoretic axioms, (A1), (A2), and (A3), which appear natural and settle some well-known questions, and I will give some metamathematical evidence supporting these axioms. I build upon a distinction between pure mathematics and applied metamathematics which views the first as an art dealing with imaginary objects, where following Poincaré we can say to exist is to be free of contradiction, and the second as a science describing the phenomenon of mathematics, where science means a description of some physical reality (in this case the reality of thoughts in our brains which underlie spoken or written mathematics). Of course this distinction is not new, but it has been disregarded by many mathematicians and philosophers who wrote about the nature of mathematics, e.g. by the Platonists, and even by some empiricists who thought that mathematics is a science. Since applied metamathematics is a science, unlike pure mathematics it has to be lean, i.e., to obey Ockham's principle of economy of concepts (entia non sunt multiplicanda praeter necessitatem).In this lean metamathematics we describe pure mathematics as a finite structure of thoughts in our brains, and we think that written or spoken mathematics is an abstract description of this structure. (I think that this is the view which Poincaré expressed informally in his discussions with the logicians and set theorists of his times, although his idea has to be modified to some extent; see Remark 4 at the end of this paper.) We claim that all mathematical objects which are imagined when we develop a (first-order) theory T can be represented by means of terms of the language of a Skolemization of the set of sentences consisting of the axioms of T and of all theorems of logic.

2009 ◽  
Vol 09 (01) ◽  
pp. 1-20 ◽  
Author(s):  
HANS ADLER

A ternary relation [Formula: see text] between subsets of the big model of a complete first-order theory T is called an independence relation if it satisfies a certain set of axioms. The primary example is forking in a simple theory, but o-minimal theories are also known to have an interesting independence relation. Our approach in this paper is to treat independence relations as mathematical objects worth studying. The main application is a better understanding of thorn-forking, which turns out to be closely related to modular pairs in the lattice of algebraically closed sets.


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

2015 ◽  
Vol 57 (2) ◽  
pp. 157-185 ◽  
Author(s):  
Peter Franek ◽  
Stefan Ratschan ◽  
Piotr Zgliczynski

1990 ◽  
Vol 55 (2) ◽  
pp. 626-636
Author(s):  
John T. Baldwin

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