Towards a computation system based on set theory

DOI10.1016/0304-3975(88)90115-6zbMATH Open0684.03022OpenAlexW1978895269MaRDI QIDQ1825191FDOQ1825191

Authors: Michael Beeson 

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

Recommendations

• New Computational Paradigms
• Set-theoretic models of computations
• scientific article; zbMATH DE number 2109540
• Set-theoretic structure of computable sets
• Publication:5749278
• Sets and computations
• Publication:3035278
• Applicable mathematics in a minimal computational theory of sets
• Set-theoretic approaches to granular computing
• ON THE COMPUTING POWER OF PROGRAMS WITH SETS

zbMATH Keywords

data structuresdenotational semanticsset theoryset-theoretic modelaxiomatic theory of sets and rulesconstructive lambda-calculusrecursion-theoretic model

Mathematics Subject Classification ID

Data structures (68P05) Combinatory logic and lambda calculus (03B40) Metamathematics of constructive systems (03F50) Abstract data types; algebraic specification (68Q65)

Cites Work

• Edinburgh LCF. A mechanized logic of computation
• Set theoretic foundations for constructive analysis
• Recursive Functionals and Quantifiers of Finite Types I
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Constructive set theory
• The lambda calculus, its syntax and semantics
• Foundations of set theory
• Title not available (Why is that?)
• The lack of definable witnesses and provably recursive functions in intuitionistic set theories
• Title not available (Why is that?)
• Title not available (Why is that?)
• The consistency of classical set theory relative to a set theory with intu1tionistic logic
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Constructive mathematics and computer programming
• The concept of function in the 19-th and 20-th centuries, in particular with regard to the discussions between Baire, Borel and Lebesgue
• An introduction to the PL/CV2 programming logic
• Pebble, a kernel language for modules and abstract data types
• An interpretation of Martin-Löf's type theory in a type-free theory of propositions
• Extracting Lisp programs from constructive proofs: A formal theory of constructive mathematics based on Lisp
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Algorithmic Thinking and Mathematical Thinking

Cited In (24)

• Operational set theory and small large cardinals
• Explicit mathematics and operational set theory: some ontological comparisons
• Relational set theory
• Extending constructive operational set theory by impredicative principles
• The Operational Perspective: Three Routes
• Title not available (Why is that?)
• Title not available (Why is that?)
• Ratio and Product Type Exponential Estimators of Population Mean in Double Sampling for Stratification
• Map theory
• A theory of computer instructions
• Title not available (Why is that?)
• Title not available (Why is that?)
• On Feferman's operational set theory \textsf{OST}
• Theory of symbolic expressions. I
• New Computational Paradigms
• A derived algorithm for evaluating \(\varepsilon\)-expressions over abstract sets
• Title not available (Why is that?)
• A naïve way of looking at fuzzy sets
• The set player system for symbolic computation on power sets
• A step semantic system for set theory
• Set-theoretic models of computations
• Title not available (Why is that?)
• The set algebra and structural analysis
• A minimal computational theory of a minimal computational universe

Uses Software

• Nuprl
• Automath
• LCF

This page was built for publication: Towards a computation system based on set theory

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