Theories without countable models

1972 ◽  
Vol 37 (3) ◽  
pp. 562-568
Author(s):  
Andreas Blass
Keyword(s):  
Standard Model ◽  
Countable Model ◽  
Compactness Theorem ◽  
Complete Theory ◽  
Natural Numbers ◽  
Axiom Schema ◽  
First Order ◽  
Order Language ◽  
The Standard Model ◽  
Skolem Theorem

Consider the Löwenheim-Skolem theorem in the form: If a theory in a countable first-order language has a model, then it has a countable model. As is well known, this theorem becomes false if one omits the hypothesis that the language be countable, for one then has the following trivial counterexample.Example 1. Let the language have uncountably many constants, and let the theory say that they are unequal.To motivate some of our future definitions and to introduce some notation, we present another, less trivial, counterexample.Example 2. Let L0 be the language whose n-place predicate (resp. function) symbols are all the n-place predicates (resp. functions) on the set ω of natural numbers. Let be the standard model for L0; we use the usual notation Th() for its complete theory. Add to L0 a new constant e, and add to Th() an axiom schema saying that e is infinite. By the compactness theorem, the resulting theory T has models. However, none of its models are countable. Although this fact is well known, we sketch a proof in order to refer to it later.By [5, p. 81], there is a family {Aα ∣ < α < c} of infinite subsets of ω, the intersection of any two of which is finite.

scholarly journals A Finitely Axiomatized Non-Classical First-Order Theory Incorporating Category Theory and Axiomatic Set Theory

Axioms ◽  
2021 ◽  
Vol 10 (2) ◽  
pp. 119
Author(s):  
Marcoen J. T. F. Cabbolet
Keyword(s):  
Set Theory ◽  
Category Theory ◽  
Present Theory ◽  
Order Theory ◽  
Countable Model ◽  
First Order ◽  
First Order Theory ◽  
Order Language ◽  
Skolem Theorem ◽  
Axiomatic Set Theory

It is well known that Zermelo-Fraenkel Set Theory (ZF), despite its usefulness as a foundational theory for mathematics, has two unwanted features: it cannot be written down explicitly due to its infinitely many axioms, and it has a countable model due to the Löwenheim–Skolem theorem. This paper presents the axioms one has to accept to get rid of these two features. For that matter, some twenty axioms are formulated in a non-classical first-order language with countably many constants: to this collection of axioms is associated a universe of discourse consisting of a class of objects, each of which is a set, and a class of arrows, each of which is a function. The axioms of ZF are derived from this finite axiom schema, and it is shown that it does not have a countable model—if it has a model at all, that is. Furthermore, the axioms of category theory are proven to hold: the present universe may therefore serve as an ontological basis for category theory. However, it has not been investigated whether any of the soundness and completeness properties hold for the present theory: the inevitable conclusion is therefore that only further research can establish whether the present results indeed constitute an advancement in the foundations of mathematics.

scholarly journals Theoretical uncertainties for cosmological first-order phase transitions

2021 ◽  
Vol 2021 (4) ◽  
Author(s):  
Djuna Croon ◽  
Oliver Gould ◽  
Philipp Schicho ◽  
Tuomas V. I. Tenkanen ◽  
Graham White
Keyword(s):  
Phase Transitions ◽  
Standard Model ◽  
Scale Dependence ◽  
Effective Field ◽  
Bubble Nucleation ◽  
Perturbative Approach ◽  
First Order ◽  
The Standard Model ◽  
First Order Phase ◽  
Renormalisation Scale

Abstract We critically examine the magnitude of theoretical uncertainties in perturbative calculations of fist-order phase transitions, using the Standard Model effective field theory as our guide. In the usual daisy-resummed approach, we find large uncertainties due to renormalisation scale dependence, which amount to two to three orders-of-magnitude uncertainty in the peak gravitational wave amplitude, relevant to experiments such as LISA. Alternatively, utilising dimensional reduction in a more sophisticated perturbative approach drastically reduces this scale dependence, pushing it to higher orders. Further, this approach resolves other thorny problems with daisy resummation: it is gauge invariant which is explicitly demonstrated for the Standard Model, and avoids an uncontrolled derivative expansion in the bubble nucleation rate.

scholarly journals Electroweak-like baryogenesis with new chiral matter

2021 ◽  
Vol 2021 (7) ◽  
Author(s):  
Kohei Fujikura ◽  
Keisuke Harigaya ◽  
Yuichiro Nakai ◽  
Ruoquan Wang
Keyword(s):  
Phase Transition ◽  
Gauge Symmetry ◽  
Cp Violation ◽  
Standard Model ◽  
Dipole Moments ◽  
Dark Matter Candidate ◽  
Lepton Asymmetry ◽  
First Order ◽  
The Standard Model ◽  
Concrete Realization

Abstract We propose a framework where a phase transition associated with a gauge symmetry breaking that occurs (not far) above the electroweak scale sets a stage for baryogenesis similar to the electroweak baryogenesis in the Standard Model. A concrete realization utilizes the breaking of SU(2)R× U(1)X→ U(1)Y. New chiral fermions charged under the extended gauge symmetry have nonzero lepton numbers, which makes the B − L symmetry anomalous. The new lepton sector contains a large flavor-dependent CP violation, similar to the Cabibbo-Kobayashi-Maskawa phase, without inducing sizable electric dipole moments of the Standard Model particles. A bubble wall dynamics associated with the first-order phase transition and SU(2)R sphaleron processes generate a lepton asymmetry, which is transferred into a baryon asymmetry via the ordinary electroweak sphaleron process. Unlike the Standard Model electroweak baryogenesis, the new phase transition can be of the strong first order and the new CP violation is not significantly suppressed by Yukawa couplings, so that the observed asymmetry can be produced. The model can be probed by collider searches for new particles and the observation of gravitational waves. One of the new leptons becomes a dark matter candidate. The model can be also embedded into a left-right symmetric theory to solve the strong CP problem.

Ring-diagram summations in the finite-temperature effective potential

1993 ◽  
Vol 71 (5-6) ◽  
pp. 227-236 ◽  
Author(s):  
M. E. Carrington
Keyword(s):  
Phase Transition ◽  
Standard Model ◽  
Effective Potential ◽  
Finite Temperature ◽  
Electroweak Phase Transition ◽  
First Order ◽  
Ring Diagram ◽  
First Order Phase Transition ◽  
The Standard Model ◽  
The One

There has been much recent interest in the finite-temperature effective potential of the standard model in the context of the electroweak phase transition. We review the calculation of the effective potential with particular emphasis on the validity of the expansions that are used. The presence of a term that is cubic in the Higgs condensate in the one-loop effective potential appears to indicate a first-order electroweak phase transition. However, in the high-temperature regime, the infrared singularities inherent in massless models produce cubic terms that are of the same order in the coupling. In this paper, we discuss the inclusion of an infinite set of these terms via the ring-diagram summation, and show that the standard model has a first-order phase transition in the weak coupling expansion.

Martin's axiom in the model theory of LA

1980 ◽  
Vol 45 (1) ◽  
pp. 172-176
Author(s):  
W. Richard Stark
Keyword(s):  
Model Theory ◽  
Equivalence Theorem ◽  
Compactness Theorem ◽  
Compactness Result ◽  
First Order ◽  
Martin's Axiom ◽  
New Class ◽  
Martin’S Axiom ◽  
Order Language ◽  
Omitting Types

Working in ZFC + Martin's Axiom we develop a generalization of the Barwise Compactness Theorem which holds in languages of cardinality less than . Next, using this compactness theorem, an omitting types theorem for fewer than types is proved. Finally, in ZFC, we prove that this compactness result implies Martin's Axiom (the Equivalence Theorem). Our compactness theorem applies to a new class of theories—ccΣ-theories—which generalize the countable Σ-theories of Barwise's theorem. The Omitting Types Theorem and the Equivalence Theorem serve as examples illustrating the use of ccΣ-theories.Assume = (A, ε) or = (A, ε R1,…,Rm) where is admissible. L() is the first-order language with constants for elements of A and relation symbols for relations in . LA is A ⋂ L∞ω where the L of L∞ω is any language in A. A theory T in LA is consistent if there is no derivation in A of a contradiction from T. is LA with new constants ca for each a and A. The basic terms of consist of the constants of and the terms f(ca1,…,cam) built directly from constants using functions f of . The symbol t is used for basic terms. A theory T in LA is Σ if it is defined by a formula of L(). The formula φ⌝ is a logical equivalent of ¬φ defined by: (1) φ⌝ = ¬φ if φ is atomic; (2) (¬φ)⌝ = φ (3) (⋁φ∈Φ φ)⌝ = ⋀φ∈Φ φ⌝; (4) (⋀φ∈Φ φ) ⋁φ∈Φ φ⌝; (5) (∃χφ(x))⌝ ∀χφ⌝(x); ∀χφ(x))⌝ = ∃χφ⌝(x).

Theories with finitely many models

1986 ◽  
Vol 51 (2) ◽  
pp. 374-376 ◽  
Author(s):  
Simon Thomas
Keyword(s):  
Natural Number ◽  
Complete Theory ◽  
Elementary Equivalence ◽  
First Order ◽  
Finite Models ◽  
Simple Observation ◽  
Finite Structure ◽  
Order Language ◽  
Complete Theories

If L is a first order language and n is a natural number, then Ln is the set of formulas which only make use of the variables x1,…,xn. While every finite structure is determined up to isomorphism by its theory in L, the same is no longer true in Ln. This simple observation is the source of a number of intriguing questions. For example, Poizat [2] has asked whether a complete theory in Ln which has at least two nonisomorphic finite models must necessarily also have an infinite one. The purpose of this paper is to present some counterexamples to this conjecture.Theorem. For each n ≤ 3 there are complete theories in L2n−2andL2n−1having exactly n + 1 models.In our notation and definitions, we follow Poizat [2]. To test structures for elementary equivalence in Ln, we shall use the modified Ehrenfeucht-Fraïssé games of Immerman [1]. For convenience, we repeat his definition here.Suppose that L is a purely relational language, each of the relations having arity at most n. Let and ℬ be two structures for L. Define the Ln game on and ℬ as follows. There are two players, I and II, and there are n pairs of counters a1, b1, …, an, bn. On each move, player I picks up any of the counters and places it on an element of the appropriate structure.

Two theorems on degrees of models of true arithmetic

1984 ◽  
Vol 49 (2) ◽  
pp. 425-436 ◽  
Author(s):  
Julia Knight ◽  
Alistair H. Lachlan ◽  
Robert I. Soare
Keyword(s):  
Standard Model ◽  
Binary Operation ◽  
Peano Arithmetic ◽  
Turing Degree ◽  
First Order ◽  
Nonstandard Model ◽  
Basis Theorem ◽  
The Standard Model ◽  
The Universe ◽  
Countable Models

Let PA be the theory of first order Peano arithmetic, in the language L with binary operation symbols + and ·. Let N be the theory of the standard model of PA. We consider countable models M of PA such that the universe ∣M∣ is ω. The degree of such a model M, denoted by deg(M), is the (Turing) degree of the atomic diagram of M. The results of this paper concern the degrees of models of N, but here in the Introduction, we shall give a brief survey of results about degrees of models of PA.Let D0 denote the set of degrees d such that there is a nonstandard model of M of PA with deg(M) = d. Here are some of the more easily stated results about D0.(1) There is no recursive nonstandard model of PA; i.e., 0 ∈ D0.This is a result of Tennenbaum [T].(2) There existsd ∈ D0such thatd ≤ 0′.This follows from the standard Henkin argument.(3) There existsd ∈ D0such thatd < 0′.Shoenfield [Sh1] proved this, using the Kreisel-Shoenfield basis theorem.(4) There existsd ∈ D0such thatd′ = 0′.Jockusch and Soare [JS] improved the Kreisel-Shoenfield basis theorem and obtained (4).(5) D0 = Dc = De, where Dc denotes the set of degrees of completions of PA and De the set of degrees d such that d separates a pair of effectively inseparable r.e. sets.Solovay noted (5) in a letter to Soare in which in answer to a question posed in [JS] he showed that Dc is upward closed.

Generalized quantifiers and elementary extensions of countable models

1977 ◽  
Vol 42 (3) ◽  
pp. 341-348 ◽  
Author(s):  
Małgorzata Dubiel
Keyword(s):  
Countable Model ◽  
Generalized Quantifiers ◽  
Natural Question ◽  
Elementary Extension ◽  
First Order ◽  
Transitive Model ◽  
Order Language ◽  
Image Position ◽  
Countable Models

Let L be a countable first-order language and L(Q) be obtained by adjoining an additional quantifier Q. Q is a generalization of the quantifier “there exists uncountably many x such that…” which was introduced by Mostowski in [4]. The logic of this latter quantifier was formalized by Keisler in [2]. Krivine and McAloon [3] considered quantifiers satisfying some but not all of Keisler's axioms. They called a formula φ(x) countable-like iffor every ψ. In Keisler's logic, φ(x) being countable-like is the same as ℳ⊨┐Qxφ(x). The main theorem of [3] states that any countable model ℳ of L[Q] has an elementary extension N, which preserves countable-like formulas but no others, such that the only sets definable in both N and M are those defined by formulas countable-like in M. Suppose C(x) in M is linearly ordered and noncountable-like but with countable-like proper segments. Then in N, C will have new elements greater than all “old” elements but no least new element — otherwise it will be definable in both models. The natural question is whether it is possible to use generalized quantifiers to extend models elementarily in such a way that a noncountable-like formula C will have a minimal new element. There are models and formulas for which it is not possible. For example let M be obtained from a minimal transitive model of ZFC by letting Qxφ(x) mean “there are arbitrarily large ordinals satisfying φ”.

scholarly journals Field-theoretic derivation of bubble-wall force

2021 ◽  
Vol 2021 (1) ◽  
Author(s):  
Marc Barroso Mancha ◽  
Tomislav Prokopec ◽  
Bogumiła Świeżewska
Keyword(s):  
Standard Model ◽  
Lorentz Factor ◽  
Momentum Tensor ◽  
Active Species ◽  
Local Thermal Equilibrium ◽  
First Order ◽  
Opposite Case ◽  
First Order Phase Transition ◽  
The Standard Model ◽  
First Order Phase

Abstract We derive a general quantum field theoretic formula for the force acting on expanding bubbles of a first order phase transition in the early Universe setting. In the thermodynamic limit the force is proportional to the entropy increase across the bubble of active species that exert a force on the bubble interface. When local thermal equilibrium is attained, we find a strong friction force which grows as the Lorentz factor squared, such that the bubbles quickly reach stationary state and cannot run away. We also study an opposite case when scatterings are negligible across the wall (ballistic limit), finding that the force saturates for moderate Lorentz factors thus allowing for a runaway behavior. We apply our formalism to a massive real scalar field, the standard model and its simple portal extension. For completeness, we also present a derivation of the renormalized, one-loop, thermal energy-momentum tensor for the standard model and demonstrate its gauge independence.

A Note on the Realization of Types

1980 ◽  
Vol 23 (1) ◽  
pp. 95-98
Author(s):  
Alan Adamson
Keyword(s):  
Complete Theory ◽  
First Order ◽  
Order Language ◽  
The Universe

Let L be a countable first-order language and T a fixed complete theory in L. If is a model of T, is an n-sequence of variables, and ā=〈a1,…, an〉 is an n-sequence of elements of M, the universe of , we let where ranges over formulas of L containing freely at most the variables υ1,…υn. ā is said to realize in We let be where is the sequence of the first n variables of L.

Sign in / Sign up

Export Citation Format

Share Document