scientific article; zbMATH DE number 7533333

DOI10.4230/LIPIcs.CSL.2018.8MaRDI QIDQ5079729

Nissan Levi, Arnon Avron, Shahar Lev

Publication date: 28 May 2022

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

decidabilityabsolutenesscomputabilitydomain independencedependent safety

Mathematics Subject Classification ID

Logic in computer science (03B70)

Related Items

Why Predicative Sets? ⋮ POINCARÉ–WEYL’S PREDICATIVITY: GOING BEYOND ⋮ WEYL REEXAMINED: “DAS KONTINUUM” 100 YEARS LATER

Cites Work

• Domain-independent formulas and databases
• Set theory. An introduction to independence proofs
• Modal languages and bounded fragments of predicate logic
• A minimal computational theory of a minimal computational universe
• Constructibility and decidability versus domain independence and absoluteness
• Formalizing Scientifically Applicable Mathematics in a Definitional Framework
• A Framework for Formalizing Set Theories Based on the Use of Static Set Terms
• The Recursive Unsolvability of the Decision Problem for the Class of Definite Formulas
• The fine structure of the constructible hierarchy
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item