Undecidability results for restricted universally quantified formulae of set theory (Q4291741): Difference between revisions
From MaRDI portal
Created a new Item |
Normalize DOI. |
||
| (6 intermediate revisions by 5 users not shown) | |||
| Property / DOI | |||
| Property / DOI: 10.1002/cpa.3160460104 / rank | |||
| Property / author | |||
| Property / author: Franco Parlamento / rank | |||
| Property / author | |||
| Property / author: Franco Parlamento / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1002/cpa.3160460104 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2005661612 / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q4268492 / rank | |||
Normal rank | |||
| Property / DOI | |||
| Property / DOI: 10.1002/CPA.3160460104 / rank | |||
Normal rank | |||
| links / mardi / name | links / mardi / name | ||
Latest revision as of 16:51, 29 December 2024
scientific article; zbMATH DE number 567370
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Undecidability results for restricted universally quantified formulae of set theory |
scientific article; zbMATH DE number 567370 |
Statements
Undecidability results for restricted universally quantified formulae of set theory (English)
0 references
17 October 1994
0 references
undecidability in first-order set theoretic language
0 references
ZF without Foundation Axiom
0 references
codings of Turing machine computations in set theoretic language
0 references
satisfiability
0 references
\(\omega\)-models
0 references
antifoundation axiom
0 references
