Minimal readability of intuitionistic arithmetic and elementary analysis

DOI10.2307/2275884zbMATH Open0854.03054OpenAlexW2133713329MaRDI QIDQ4876321FDOQ4876321

Authors: Zlatan Damnjanovic 

Publication date: 13 January 1997

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

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

Recommendations

• On intuitionistic elementary arithmetic
• Some elementary results in intuitionistic model theory
• Intuitionistic elementary arithmetic
• Publication:4944901
• Realizability and intuitionistic logic
• Absolute \(L\)-realizability and intuitionistic logic
• Arithmetical realizability and primitive recursive realizability
• Undecidability of the real-algebraic structure of models of intuitionistic elementary analysis
• Minimal elementary extensions of models of set theory and arithmetic
• scientific article; zbMATH DE number 4033722

zbMATH Keywords

Peano arithmeticdefinable functionsSkolem functionsHeyting arithmeticprovably recursive functionsintuitionistic finite-type arithmeticelementary analysisminimal realizability

Mathematics Subject Classification ID

First-order arithmetic and fragments (03F30) Intuitionistic mathematics (03F55)

Cites Work

• Title not available (Why is that?)
• Rapidly growing Ramsey functions
• Title not available (Why is that?)
• A classification of the ordinal recursive functions
• Syntactic translations and provably recursive functions
• Nested recursion
• Ordinal recursion, and a refinement of the extended Grzegorczyk hierarchy

Cited In (14)

• Title not available (Why is that?)
• Elementary realizability
• General recursive realizability and basic logic
• Functional interpretations of feasibly constructive arithmetic
• On Primitive Recursive Realizabilities
• An extensional Kleene realizability semantics for the Minimalist Foundation
• On excluded minors for real-representability
• A Generalized Realizability and Intuitionistic Logic
• Strictly primitive recursive realizability, I
• Proof-theoretical analysis: Weak systems of functions and classes
• MINIMAL AXIOMATIC FRAMEWORKS FOR DEFINABLE HYPERREALS WITH TRANSFER
• Some elementary results in intuitionistic model theory
• General recursive realizability and intuitionistic logic
• Polynomially bounded recursive realizability

This page was built for publication: Minimal readability of intuitionistic arithmetic and elementary analysis

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4876321)