Towards a computation system based on set theory
From MaRDI portal
Publication:1825191
DOI10.1016/0304-3975(88)90115-6zbMath0684.03022OpenAlexW1978895269MaRDI QIDQ1825191
Publication date: 1988
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0304-3975(88)90115-6
data structuresset theorydenotational semanticsset-theoretic modelaxiomatic theory of sets and rulesconstructive lambda-calculusrecursion-theoretic model
Abstract data types; algebraic specification (68Q65) Data structures (68P05) Metamathematics of constructive systems (03F50) Combinatory logic and lambda calculus (03B40)
Related Items (8)
A naïve way of looking at fuzzy sets ⋮ On Feferman's operational set theory \textsf{OST} ⋮ The Operational Perspective: Three Routes ⋮ Extending constructive operational set theory by impredicative principles ⋮ Map theory ⋮ EXPLICIT MATHEMATICS AND OPERATIONAL SET THEORY: SOME ONTOLOGICAL COMPARISONS ⋮ Operational set theory and small large cardinals ⋮ A derived algorithm for evaluating \(\varepsilon\)-expressions over abstract sets
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Foundations of set theory
- Extracting Lisp programs from constructive proofs: A formal theory of constructive mathematics based on Lisp
- The lack of definable witnesses and provably recursive functions in intuitionistic set theories
- Pebble, a kernel language for modules and abstract data types
- The lambda calculus, its syntax and semantics
- An introduction to the PL/CV2 programming logic
- Set theoretic foundations for constructive analysis
- Edinburgh LCF. A mechanized logic of computation
- The concept of function in the 19-th and 20-th centuries, in particular with regard to the discussions between Baire, Borel and Lebesgue
- Recursive Functionals and Quantifiers of Finite Types I
- Constructive mathematics and computer programming
- Algorithmic Thinking and Mathematical Thinking
- An interpretation of Martin-Löf's type theory in a type-free theory of propositions
- Constructive set theory
- The consistency of classical set theory relative to a set theory with intu1tionistic logic
This page was built for publication: Towards a computation system based on set theory