Applicable Mathematics in a Minimal Computational Theory of Sets
From MaRDI portal
Publication:4553281
DOI10.23638/LMCS-14(4:1)2018zbMath1454.03064arXiv1801.02387MaRDI QIDQ4553281
Publication date: 2 November 2018
Full work available at URL: https://arxiv.org/abs/1801.02387
Mechanization of proofs and logical operations (03B35) Axiomatics of classical set theory and its fragments (03E30)
Related Items (2)
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
- Using typed lambda calculus to implement formal systems on a machine
- Thirty-five years of automating mathematics. Dedicated to 35 years of de Bruijn's Automath
- Operational set theory and small large cardinals
- Set theoretic foundations for constructive analysis
- Isabelle/HOL. A proof assistant for higher-order logic
- Rudimentary recursion, gentle functions and provident sets
- Constructibility and decidability versus domain independence and absoluteness
- Foundations of set theory. With the collaboration of Dirk van Dalen. 2nd revised ed
- EXPLICIT MATHEMATICS AND OPERATIONAL SET THEORY: SOME ONTOLOGICAL COMPARISONS
- SAFE RECURSIVE SET FUNCTIONS
- Algebraic Properties of the Elementary Functions of Analysis
- A framework for defining logics
- Constructive set theory
- Formalizing Scientifically Applicable Mathematics in a Definitional Framework
- Computational Logic and Set Theory
- Systems of predicative analysis
- A Framework for Formalizing Set Theories Based on the Use of Static Set Terms
- Systems of predicative analysis, II: Representations of ordinals
- Variable Binding Term Operators
- The fine structure of the constructible hierarchy
- A homogeneous system for formal logic
This page was built for publication: Applicable Mathematics in a Minimal Computational Theory of Sets
