scientific article; zbMATH DE number 3566838
From MaRDI portal
zbMath0364.02032MaRDI QIDQ4138726
Laurence Kirby, Jeffrey Bruce Paris
Publication date: 1977
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
The strength of infinitary Ramseyan principles can be accessed by their densities, Factorization of polynomials and \(\Sigma ^ 0_ 1\) induction, The computability, definability, and proof theory of Artinian rings, Duality, non-standard elements, and dynamic properties of r.e. sets, Reducibilities Among Decision Problems for HNN Groups, Vector Addition Systems and Subsystems of Peano Arithmetic, A note on the variety of satisfaction classes, Σ_{𝑛}-bounding and Δ_{𝑛}-induction, Definable sets and expansions of models of Peano arithmetic, Automorphisms of models of arithmetic: a unified view, Automorphisms of countable recursively saturated models of PA: A survey, Four problems concerning recursively saturated models of arithmetic, Arithmetically saturated models of arithmetic, The theory of \(\kappa\)-like models of arithmetic, Normal subgroups of nonstandard symmetric and alternating groups, Transfinite induction within Peano arithmetic, On Extensions of Models of Strong Fragments of Arithmetic, Constant regions in models of arithmetic, The Paris-Harrington principle and second-order arithmetic -- bridging the finite and infinite Ramsey theorem, Truth in generic cuts, Some bounds for the Ramsey-Paris-Harrington numbers, Independence results in computer science?, Combinatorial principles concerning approximations of functions, Definability of initial segments, Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 5--11, 2017, Automorphisms of recursively saturated models of arithmetic, Complexity among the finitely generated subgroups of Thompson's group, The self-embedding theorem of \(\text{WKL}_ 0\) and a non-standard method, On cofinal submodels and elementary interstices, A simple proof of Parsons' theorem, Connected components of graphs and reverse mathematics, On Gödel incompleteness and finite combinatorics, A standard model of Peano arithmetic with no conservative elementary extension, Which set existence axioms are needed to prove the separable Hahn-Banach theorem?, Saturation and simple extensions of models of Peano arithmetic, Rank-initial embeddings of non-standard models of set theory, Ultrafilters and types on models of arithmetic, Petri nets and large finite sets, Countable algebra and set existence axioms, Extendible Sets in Peano Arithmetic
