Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Alfred Tarski and decidable theories

From MaRDI portal
Publication:3791109
Jump to:navigation, search

DOI10.2307/2274425zbMath0647.03001OpenAlexW4236098198MaRDI QIDQ3791109

Wilfrid Hodges, John Doner

Publication date: 1988

Published in: The Journal of Symbolic Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2274425


zbMATH Keywords

fieldsgeometrycompletenessBoolean algebrasTarskilinear ordersdecidability


Mathematics Subject Classification ID

History of mathematics in the 20th century (01A60) Decidability of theories and sets of sentences (03B25) History of mathematical logic and foundations (03-03) Quantifier elimination, model completeness, and related topics (03C10) Categoricity and completeness of theories (03C35)


Related Items

Synthetic undecidability and incompleteness of first-order axiom systems in Coq. Extended version ⋮ Unnamed Item ⋮ Invariants, Boolean algebras and ACA₀⁺ ⋮ Address at the Princeton University Bicentennial Conference on Problems of Mathematics (December 17–19, 1946), By Alfred Tarski



Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3791109&oldid=17353542"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 5 February 2024, at 14:45.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki