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