Epstein Files Full PDF

CLICK HERE
Technopedia Center
PMB University Brochure
Faculty of Engineering and Computer Science
S1 Informatics S1 Information Systems S1 Information Technology S1 Computer Engineering S1 Electrical Engineering S1 Civil Engineering

faculty of Economics and Business
S1 Management S1 Accountancy

Faculty of Letters and Educational Sciences
S1 English literature S1 English language education S1 Mathematics education S1 Sports Education
teknopedia

  • Registerasi
  • Brosur UTI
  • Kip Scholarship Information
  • Performance
Flag Counter
  1. World Encyclopedia
  2. Spectrum of a theory - Wikipedia
Spectrum of a theory - Wikipedia
From Wikipedia, the free encyclopedia
Model theory concept

In model theory, a branch of mathematical logic, the spectrum of a theory is given by the number of isomorphism classes of models in various cardinalities. More precisely, for any complete theory T in a language we write I(T, κ) for the number of models of T (up to isomorphism) of cardinality κ. The spectrum problem is to describe the possible behaviors of I(T, κ) as a function of κ. It has been almost completely solved for the case of a countable theory T.

Early results

[edit]

In this section T is a countable complete theory and κ is a cardinal.

The Löwenheim–Skolem theorem shows that if I(T,κ) is nonzero for one infinite cardinal then it is nonzero for all of them.

Morley's categoricity theorem was the first main step in solving the spectrum problem: it states that if I(T,κ) is 1 for some uncountable κ then it is 1 for all uncountable κ.

Robert Vaught showed that I(T,ℵ0) cannot be 2. It is easy to find examples where it is any given non-negative integer other than 2. Morley proved that if I(T,ℵ0) is infinite then it must be ℵ0 or ℵ1 or 2ℵ0. It is not known if it can be ℵ1 if the continuum hypothesis is false: this is called the Vaught conjecture and is the main remaining open problem (in 2005) in the theory of the spectrum.

Morley's problem was a conjecture (now a theorem) first proposed by Michael D. Morley that I(T,κ) is nondecreasing in κ for uncountable κ. This was proved by Saharon Shelah. For this, he proved a very deep dichotomy theorem.

Saharon Shelah gave an almost complete solution to the spectrum problem. For a given complete theory T, either I(T,κ) = 2κ for all uncountable cardinals κ, or I ( T , ℵ ξ ) < ℶ ω 1 ( | ξ | + ℵ 0 ) {\displaystyle \textstyle I(T,\aleph _{\xi })<\beth _{\omega _{1}}(|\xi |+\aleph _{0})} {\displaystyle \textstyle I(T,\aleph _{\xi })<\beth _{\omega _{1}}(|\xi |+\aleph _{0})} for all ordinals ξ (See Aleph number and Beth number for an explanation of the notation), which is usually much smaller than the bound in the first case. Roughly speaking this means that either there are the maximum possible number of models in all uncountable cardinalities, or there are only "few" models in all uncountable cardinalities. Shelah also gave a description of the possible spectra in the case when there are few models.

List of possible spectra of a countable theory

[edit]

By extending Shelah's work, Bradd Hart, Ehud Hrushovski and Michael C. Laskowski gave the following complete solution to the spectrum problem for countable theories in uncountable cardinalities. If T is a countable complete theory, then the number I(T, ℵα) of isomorphism classes of models is given for ordinals α>0 by the minimum of 2ℵα and one of the following maps:

  1. 2ℵα. Examples: there are many examples, in particular any unclassifiable or deep theory, such as the theory of the Rado graph.
  2. ℶ d + 1 ( | α + ω | ) {\displaystyle \beth _{d+1}(|\alpha +\omega |)} {\displaystyle \beth _{d+1}(|\alpha +\omega |)} for some countable infinite ordinal d. (For finite d see case 8.) Examples: The theory with equivalence relations Eβ for all β with β+1<d, such that every Eγ class is a union of infinitely many Eβ classes, and each E0 class is infinite.
  3. ℶ d − 1 ( | α + ω | 2 ℵ 0 ) {\displaystyle \beth _{d-1}(|\alpha +\omega |^{2^{\aleph _{0}}})} {\displaystyle \beth _{d-1}(|\alpha +\omega |^{2^{\aleph _{0}}})} for some finite positive ordinal d. Example (for d=1): the theory of countably many independent unary predicates.
  4. ℶ d − 1 ( | α + ω | ℵ 0 + ℶ 2 ) {\displaystyle \beth _{d-1}(|\alpha +\omega |^{\aleph _{0}}+\beth _{2})} {\displaystyle \beth _{d-1}(|\alpha +\omega |^{\aleph _{0}}+\beth _{2})} for some finite positive ordinal d.
  5. ℶ d − 1 ( | α + ω | + ℶ 2 ) {\displaystyle \beth _{d-1}(|\alpha +\omega |+\beth _{2})} {\displaystyle \beth _{d-1}(|\alpha +\omega |+\beth _{2})} for some finite positive ordinal d;
  6. ℶ d − 1 ( | α + ω | ℵ 0 ) {\displaystyle \beth _{d-1}(|\alpha +\omega |^{\aleph _{0}})} {\displaystyle \beth _{d-1}(|\alpha +\omega |^{\aleph _{0}})} for some finite positive ordinal d. Example (for d=1): the theory of countable many disjoint unary predicates.
  7. ℶ d − 1 ( | α + ω | + ℶ 1 ) {\displaystyle \beth _{d-1}(|\alpha +\omega |+\beth _{1})} {\displaystyle \beth _{d-1}(|\alpha +\omega |+\beth _{1})} for some finite ordinal d≥2;
  8. ℶ d − 1 ( | α + ω | ) {\displaystyle \beth _{d-1}(|\alpha +\omega |)} {\displaystyle \beth _{d-1}(|\alpha +\omega |)} for some finite positive ordinal d;
  9. ℶ d − 2 ( | α + ω | | α + 1 | ) {\displaystyle \beth _{d-2}(|\alpha +\omega |^{|\alpha +1|})} {\displaystyle \beth _{d-2}(|\alpha +\omega |^{|\alpha +1|})} for some finite ordinal d≥2; Examples: similar to case 2.
  10. ℶ 2 {\displaystyle \beth _{2}} {\displaystyle \beth _{2}}. Example: the theory of the integers viewed as an abelian group.
  11. | ( α + 1 ) n / G | − | α n / G | {\displaystyle |(\alpha +1)^{n}/G|-|\alpha ^{n}/G|} {\displaystyle |(\alpha +1)^{n}/G|-|\alpha ^{n}/G|} for finite α, and |α| for infinite α, where G is some subgroup of the symmetric group on n ≥ 2 elements. Here, we identify αn with the set of sequences of length n of elements of a set of size α. G acts on αn by permuting the sequence elements, and |αn/G| denotes the number of orbits of this action. Examples: the theory of the set ω×n acted on by the wreath product of G with all permutations of ω.
  12. 1 {\displaystyle 1} {\displaystyle 1}. Examples: theories that are categorical in uncountable cardinals, such as the theory of algebraically closed fields in a given characteristic.
  13. 0 {\displaystyle 0} {\displaystyle 0}. Examples: theories with a finite model, and the inconsistent theory.

Moreover, all possibilities above occur as the spectrum of some countable complete theory.

The number d in the list above is the depth of the theory. If T is a theory we define a new theory 2T to be the theory with an equivalence relation such that there are infinitely many equivalence classes each of which is a model of T. We also define theories ℶ n ( T ) {\displaystyle \beth _{n}(T)} {\displaystyle \beth _{n}(T)} by ℶ 0 ( T ) = T {\displaystyle \beth _{0}(T)=T} {\displaystyle \beth _{0}(T)=T}, ℶ n + 1 ( T ) = 2 ℶ n ( T ) {\displaystyle \beth _{n+1}(T)=2^{\beth _{n}(T)}} {\displaystyle \beth _{n+1}(T)=2^{\beth _{n}(T)}}. Then I ( ℶ n ( T ) , λ ) = min ( ℶ n ( I ( T , λ ) ) , 2 λ ) {\displaystyle I(\beth _{n}(T),\lambda )=\min(\beth _{n}(I(T,\lambda )),2^{\lambda })} {\displaystyle I(\beth _{n}(T),\lambda )=\min(\beth _{n}(I(T,\lambda )),2^{\lambda })} . This can be used to construct examples of theories with spectra in the list above for non-minimal values of d from examples for the minimal value of d.

See also

[edit]
  • Spectrum of a sentence

References

[edit]
  • C. C. Chang, H. J. Keisler, Model Theory. ISBN 0-7204-0692-7
  • Saharon Shelah, "Classification theory and the number of nonisomorphic models", Studies in Logic and the Foundations of Mathematics, vol. 92, IX, 1.19, p.49 (North Holland, 1990).
  • Hart, Bradd; Hrushovski, Ehud; Laskowski, Michael C. (2000). "The Uncountable Spectra of Countable Theories". The Annals of Mathematics. 152 (1): 207–257. arXiv:math/0007199. Bibcode:2000math......7199H. doi:10.2307/2661382. JSTOR 2661382.
  • Bradd Hart, Michael C. Laskowski, "A survey of the uncountable spectra of countable theories", Algebraic Model Theory, edited by Hart, Lachlan, Valeriote (Springer, 1997). ISBN 0-7923-4666-1
  • v
  • t
  • e
Mathematical logic
General
  • Axiom
    • list
  • Cardinality
  • First-order logic
  • Formal proof
  • Formal semantics
  • Foundations of mathematics
  • Information theory
  • Lemma
  • Logical consequence
  • Model
  • Theorem
  • Theory
  • Type theory
Theorems
(list),
paradoxes
  • Gödel's completeness – incompleteness theorems
  • Tarski's undefinability
  • Banach–Tarski paradox
  • Cantor's theorem – paradox – diagonal argument
  • Compactness
  • Halting problem
  • Lindström's
  • Löwenheim–Skolem
  • Russell's paradox
Logics
Traditional
  • Classical logic
  • Logical truth
  • Tautology
  • Proposition
  • Inference
  • Logical equivalence
  • Consistency
    • Equiconsistency
  • Argument
  • Soundness
  • Validity
  • Syllogism
  • Square of opposition
  • Venn diagram
Propositional
  • Boolean algebra
  • Boolean functions
  • Logical connectives
  • Propositional calculus
  • Propositional formula
  • Truth tables
  • Many-valued logic
    • 3
    • finite
    • ∞
Predicate
  • First-order
    • list
  • Second-order
    • Monadic
  • Higher-order
  • Fixed-point
  • Free
  • Quantifiers
  • Predicate
  • Monadic predicate calculus
Set theory
  • Set
    • hereditary
  • Class
  • (Ur-)Element
  • Ordinal number
  • Extensionality
  • Forcing
  • Relation
    • equivalence
    • partition
  • Set operations:
    • intersection
    • union
    • complement
    • Cartesian product
    • power set
    • identities
Types
of sets
  • Countable
  • Uncountable
  • Empty
  • Inhabited
  • Singleton
  • Finite
  • Infinite
  • Transitive
  • Ultrafilter
  • Recursive
  • Fuzzy
  • Universal
  • Universe
    • constructible
    • Grothendieck
    • Von Neumann
Maps,
cardinality
  • Function/Map
    • domain
    • codomain
    • image
  • In/Sur/Bi-jection
  • Schröder–Bernstein theorem
  • Isomorphism
  • Gödel numbering
  • Enumeration
  • Large cardinal
    • inaccessible
  • Aleph number
  • Operation
    • binary
Theories
  • Zermelo–Fraenkel
    • axiom of choice
    • continuum hypothesis
  • General
  • Kripke–Platek
  • Morse–Kelley
  • Naive
  • New Foundations
  • Tarski–Grothendieck
  • Von Neumann–Bernays–Gödel
  • Ackermann
  • Constructive
Formal
systems

(list),
language,
syntax
  • Alphabet
  • Arity
  • Automata
  • Axiom schema
  • Expression
    • ground
  • Extension
    • by definition
    • conservative
  • Relation
  • Formation rule
  • Grammar
  • Formula
    • atomic
    • closed
    • ground
    • open
  • Free/bound variable
  • Language
  • Metalanguage
  • Logical connective
    • ¬
    • ∨
    • ∧
    • →
    • ↔
    • =
  • Predicate
    • functional
    • variable
    • propositional variable
  • Proof
  • Quantifier
    • ∃
    • !
    • ∀
    • rank
  • Sentence
    • atomic
    • spectrum
  • Signature
  • String
  • Substitution
  • Symbol
    • function
    • logical/constant
    • non-logical
    • variable
  • Term
  • Theory
    • list
Example
axiomatic
systems

(list)
  • of true arithmetic
    • Peano
    • second-order
    • elementary function
    • primitive recursive
    • Robinson
    • Skolem
  • of the real numbers
    • Tarski's axiomatization
  • of Boolean algebras
    • canonical
    • minimal axioms
  • of geometry
    • Euclidean
      • Elements
      • Hilbert's
      • Tarski's
    • non-Euclidean
  • Principia Mathematica
Proof theory
  • Formal proof
  • Natural deduction
  • Logical consequence
  • Rule of inference
  • Sequent calculus
  • Theorem
  • Systems
    • axiomatic
    • deductive
    • Hilbert
      • list
  • Complete theory
  • Independence (from ZFC)
  • Proof of impossibility
  • Ordinal analysis
  • Reverse mathematics
  • Self-verifying theories
Model theory
  • Interpretation
    • function
    • of models
  • Model
    • atomic
    • equivalence
    • finite
    • prime
    • saturated
    • spectrum
    • submodel
  • Non-standard model
    • of non-standard arithmetic
  • Diagram
    • elementary
  • Categorical theory
  • Model complete theory
  • Satisfiability
  • Semantics of logic
  • Strength
  • Theories of truth
    • semantic
    • Tarski's
    • Kripke's
  • T-schema
  • Transfer principle
  • Truth predicate
  • Truth value
  • Type
  • Ultraproduct
  • Validity
Computability
theory
  • Church encoding
  • Church–Turing thesis
  • Computably enumerable
  • Computable function
  • Computable set
  • Decision problem
    • decidable
    • undecidable
    • P
    • NP
    • P versus NP problem
  • Kolmogorov complexity
  • Lambda calculus
  • Primitive recursive function
  • Recursion
  • Recursive set
  • Turing machine
  • Type theory
Related
  • Abstract logic
  • Algebraic logic
  • Automated theorem proving
  • Category theory
  • Concrete/Abstract category
  • Category of sets
  • History of logic
  • History of mathematical logic
    • timeline
  • Logicism
  • Mathematical object
  • Philosophy of mathematics
  • Supertask
icon Mathematics portal
Retrieved from "https://teknopedia.ac.id/w/index.php?title=Spectrum_of_a_theory&oldid=1214580077"
Category:
  • Model theory
Hidden categories:
  • Articles with short description
  • Short description matches Wikidata

  • indonesia
  • Polski
  • العربية
  • Deutsch
  • English
  • Español
  • Français
  • Italiano
  • مصرى
  • Nederlands
  • 日本語
  • Português
  • Sinugboanong Binisaya
  • Svenska
  • Українська
  • Tiếng Việt
  • Winaray
  • 中文
  • Русский
Sunting pranala
url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url url
Pusat Layanan

UNIVERSITAS TEKNOKRAT INDONESIA | ASEAN's Best Private University
Jl. ZA. Pagar Alam No.9 -11, Labuhan Ratu, Kec. Kedaton, Kota Bandar Lampung, Lampung 35132
Phone: (0721) 702022
Email: pmb@teknokrat.ac.id