scientific article

Publication date: 1985

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

constructive mathematics proof theory set theory constructive proof intuitionistic logic formal systems constructive metamathematics

Mathematics Subject Classification ID

Constructive and recursive analysis (03F60) Research exposition (monographs, survey articles) pertaining to mathematical logic and foundations (03-02) Other constructive mathematics (03F65) Metamathematics of constructive systems (03F50) Intuitionistic mathematics (03F55)

Related Items (only showing first 100 items - show all)

Computational complexity of optimization and crude range testing: A new approach motivated by fuzzy optimization ⋮ Constructibility of the universal wave function ⋮ SENSE AND REFERENCE FROM A CONSTRUCTIVIST STANDPOINT ⋮ Metamathematical properties of a constructive multi-typed theory ⋮ A proof–technique in uniform space theory ⋮ Wellordering proofs for metapredicative Mahlo ⋮ On the Lebesgue measurability of continuous functions in constructive analysis ⋮ Representations and the foundations of mathematics ⋮ Nominal logic, a first order theory of names and binding ⋮ A constructive approach to nonstandard analysis ⋮ Tableaux for free logics with descriptions ⋮ Unitary Theories, Unitary Categories ⋮ Effective applicative structures ⋮ Totality in applicative theories ⋮ Image of Soviet and Russian logic in the West. Latter Half of the XXth Century ⋮ A feasible theory of truth over combinatory algebra ⋮ CZF does not have the existence property ⋮ Justification logic and type theory as formalizations of intuitionistic propositional logic ⋮ Betwixt Turing and Kleene ⋮ Between Turing and Kleene ⋮ Strongly Noetherian rings and constructive ideal theory ⋮ Some logical metatheorems with applications in functional analysis ⋮ A Burgessian critique of nominalistic tendencies in contemporary mathematics and its historiography ⋮ Strong and Uniform Continuity – the Uniform Space Case ⋮ The Relevance of Computation Irreducibility as Computation Universality in Economics ⋮ Spectra of selfadjoint operators in constructive analysis ⋮ A MARRIAGE OF BROUWER’S INTUITIONISM AND HILBERT’S FINITISM I: ARITHMETIC ⋮ Systems of explicit mathematics with non-constructive \(\mu\)-operator. II ⋮ Monotone recursive definition of predicates and its realizability interpretation ⋮ Adding proof objects and inductive definition mechanisms to frege structures ⋮ Equivalence of bar induction and bar recursion for continuous functions with continuous moduli ⋮ Representing definable functions of \(\mathrm{HA}^{\omega}\) by neighbourhood functions ⋮ Radical theory of Scott-open filters ⋮ Satisfiability is false intuitionistically: a question from Dana Scott ⋮ Paradox and potential infinity ⋮ Five stages of accepting constructive mathematics ⋮ Realisability for infinitary intuitionistic set theory ⋮ Singular coverings and non‐uniform notions of closed set computability ⋮ The knaster-tarski fixed-point theorem is not uniformly constructive ⋮ The Brouwer invariance theorems in reverse mathematics ⋮ On the Semantics of Intensionality ⋮ Montague's paradox, informal provability, and explicit modal logic ⋮ Polynomial time operations in explicit mathematics ⋮ The principle of pointfree continuity ⋮ On Feferman's operational set theory \textsf{OST} ⋮ Ordinal Analysis of Intuitionistic Power and Exponentiation Kripke Platek Set Theory ⋮ The Operational Perspective: Three Routes ⋮ Reverse mathematics of topology: dimension, paracompactness, and splittings ⋮ Validating Brouwer's continuity principle for numbers using named exceptions ⋮ Induction, constructivity, and grounding ⋮ Collapsing partial combinatory algebras ⋮ Free logics are cut-free ⋮ Reflection principles for synthetic theories of smooth manifolds ⋮ Applicable Mathematics in a Minimal Computational Theory of Sets ⋮ Upper bounds for metapredicative Mahlo in explicit mathematics and admissible set theory ⋮ The axiom of choice and combinatory logic ⋮ Ranked partial structures ⋮ Singular Coverings and Non-Uniform Notions of Closed Set Computability ⋮ Toward a clarity of the extreme value theorem ⋮ Abstraction in algorithmic logic ⋮ AXIOMS FOR DETERMINATENESS AND TRUTH ⋮ Metrization Theorem for Space-Times: From Urysohn’s Problem towards Physically Useful Constructive Mathematics ⋮ Proofs and retributions, or: why Sarah can't take limits ⋮ CZF and second order arithmetic ⋮ Characterizing the interpretation of set theory in Martin-Löf type theory ⋮ On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting ⋮ Unnamed Item ⋮ The Skolemization of existential quantifiers in intuitionistic logic ⋮ TRUNCATION AND SEMI-DECIDABILITY NOTIONS IN APPLICATIVE THEORIES ⋮ COMPUTABILITY THEORY, NONSTANDARD ANALYSIS, AND THEIR CONNECTIONS ⋮ SEPARATING THE FAN THEOREM AND ITS WEAKENINGS II ⋮ Unnamed Item ⋮ A mechanization of strong Kleene logic for partial functions ⋮ Deflationism beyond arithmetic ⋮ The paradox of phase transitions in the light of constructive mathematics ⋮ Elementary explicit types and polynomial time operations ⋮ Reverse formalism 16 ⋮ A Kuroda-style \(j\)-translation ⋮ A flexible type system for the small Veblen ordinal ⋮ From term models to domains ⋮ COMPUTABILITY IN PARTIAL COMBINATORY ALGEBRAS ⋮ Realisability in weak systems of explicit mathematics ⋮ Nets and reverse mathematics ⋮ Predicativity and constructive mathematics ⋮ A categorical reading of the numerical existence property in constructive foundations ⋮ Formalizing forcing arguments in subsystems of second-order arithmetic ⋮ Systems of explicit mathematics with non-constructive \(\mu\)-operator and join ⋮ Remarks on applicative theories ⋮ Reflections on reflections in explicit mathematics ⋮ On Goodman realizability ⋮ Strong continuity implies uniform sequential continuity ⋮ Free Definite Description Theory – Sequent Calculi and Cut Elimination ⋮ Dynamical algebraic structures, pointfree topological spaces and Hilbert's program. (Structures algébriques dynamiques, espaces topologiques sans points et programme de Hilbert) ⋮ ORDINAL ANALYSIS OF PARTIAL COMBINATORY ALGEBRAS ⋮ A new model construction by making a detour via intuitionistic theories. II: Interpretability lower bound of Feferman's explicit mathematics \(T_0\) ⋮ Algebras of complemented subsets ⋮ Applicative theories for logarithmic complexity classes ⋮ A new model construction by making a detour via intuitionistic theories. III: Ultrafinitistic proofs of conservations of \(\Sigma_1^1\) collection ⋮ Bishop-Style Constructive Reverse Mathematics ⋮ Constructive mathematics, Church's thesis, and free choice sequences

This page was built for publication: