Publication:2281321: Difference between revisions
Created automatically from import240129110113 |
(No difference)
|
Latest revision as of 11:37, 2 February 2024
DOI10.1016/J.AIM.2019.106884zbMATH Open1506.03087OpenAlexW2990299246WikidataQ126647855 ScholiaQ126647855MaRDI QIDQ2281321FDOQ2281321
Publication date: 19 December 2019
Published in: Advances in Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.aim.2019.106884
self-embedding\( \forall \exists\) arithmeticon-line graph colouringr.e. prime powerr.e. ultrapowerrecursive ultrapower
Models with special properties (saturated, rigid, etc.) (03C50) Coloring of graphs and hypergraphs (05C15) Ultraproducts and related constructions (03C20) Models of arithmetic and set theory (03C62) Nonstandard models of arithmetic (03H15)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Effective coloration
- Coloring inductive graphs on-line
- On-line and first fit colorings of graphs
- Monadic Elementary Formal Systems
- Continuous colouring of closed graphs
- Partial Orders on the Types in βN
- Recursive Colorings of Graphs
- Discernible elements in models for Peano arithmetic
- A Note on a Theorem of H. FRIEDMAN
- On Partially Conservative Sentences and Interpretability
- Forcing, arithmetic, division rings
- Models and types of Peano's arithmetic
- \(r\)-maximal major subsets
- Models of arithmetic and recursive functions
- Sub-arithmetical ultrapowers: A survey
- Some Extension and Rearrangement Theorems For Nerode Semirings
- \(\Delta_{1}\) ultrapowers are totally rigid
- Some properties of \(r\)-maximal sets and \(Q_{1,N}\)-reducibility
- Recursive Functions Modulo Co-r-Maximal Sets
- Duality, non-standard elements, and dynamic properties of r.e. sets
- A note on effective ultrapowers: Uniform failure of bounded collection
This page was built for publication: R.e. Prime powers and total rigidity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2281321)