Strong negation in the theory of computable functionals TCF
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 4070894 (Why is no real title available?)
- scientific article; zbMATH DE number 3687373 (Why is no real title available?)
- scientific article; zbMATH DE number 3291139 (Why is no real title available?)
- AFFINE LOGIC FOR CONSTRUCTIVE MATHEMATICS
- Algebras of complemented subsets
- An algebraic approach to non-classical logics
- Bases of Pseudocompact Bishop Spaces
- Complemented subsets and Boolean-valued, partial functions
- Computational Aspects of Bishop’s Constructive Mathematics
- Constructible falsity
- Constructible falsity and inexact predicates
- Constructive logic with strong negation is a substructural logic. I
- Constructive logic with strong negation is a substructural logic. II
- Constructive predicate logic with strong negation and model theory
- Constructive topology of Bishop spaces
- Constructive uniformities of pseudometrics and Bishop topologies
- Der Minimalkalkül, ein reduzierter intuitionistischer Formalismus.
- Direct spectra of Bishop spaces and their limits
- Embeddings of Bishop spaces
- Intuitionistic logic with strong negation
- Program Extraction in Constructive Analysis
- Proof-relevance in Bishop-style constructive mathematics
- Proofs and computations
- Über das Prinzip tertium non datur.
This page was built for publication: Strong negation in the theory of computable functionals TCF
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6987766)
