scientific article; zbMATH DE number 3900744
From MaRDI portal
Publication:3679172
Recommendations
Cited in
(only showing first 100 items - show all)- Patterns of resemblance of order 2
- Operational domain theory and topology of sequential programming languages
- Full operational set theory with unbounded existential quantification and power set
- A minimalist two-level foundation for constructive mathematics
- On the syntax of Martin-Löf's type theories
- Between constructive mathematics and PROLOG
- On the status of proofs by contradiction in the seventeenth century
- Finite type structures within combinatory algebras
- Constructivism in mathematics. An introduction. Volume I
- Constructivism in mathematics. An introduction. Volume II
- Extensions and fixed points of contractive maps in \(\mathbb{R}^ n\)
- Extension of combinatory logic to a theory of combinatory representation
- A transfer theorem in constructive \(p\)-adic algebra
- Some aspects of effectively constructive mathematics that are relevant to the foundations of neoclassical mathematical economics and the theory of games
- A theory for program and data type specification
- Self-witnessing polynomial-time complexity and prime factorization
- Hilbert's \(\varepsilon{}\)-operator and classical logic
- Constructive mathematics: a foundation for computable analysis
- Predicative functionals and an interpretation of \({\widehat{\text{ID}}_{<\omega}}\)
- Well-ordering proofs for Martin-Löf type theory
- Point-free topological spaces, functions and recursive points; filter foundation for recursive analysis. I
- Realizability interpretation of coinductive definitions and program synthesis with streams
- Systems of explicit mathematics with non-constructive \(\mu\)-operator. I
- Realizability interpretation of generalized inductive definitions
- The strength of some Martin-Löf type theories
- Formalizing non-termination of recursive programs
- On the proof-theoretic strength of monotone induction in explicit mathematics
- Extensional realizability
- The constructive theory of preference relations on a locally compact space. II
- Provability in principle and controversial constructivistic principles
- History and philosophy of constructive type theory
- Unique existence, approximate solutions, and countable choice.
- A constructive theory of point-set nearness.
- Theories with self-application and computational complexity.
- Ishihara's proof technique in constructive analysis
- Polynat in PER models
- Functional interpretation of Aczel's constructive set theory
- The unfolding of non-finitist arithmetic
- The non-constructive operator, fixed point theories with ordinals, and the bar rule
- Category theory and the foundations of mathematics: philosophical excavations.
- Wittgenstein and finitism
- Computationalism
- Rational presented metric spaces and complexity, the case of the space of real functions uniformly continuous on a compact interval
- A new graph characteristic and its application to numerical computability
- Kernels of seminorms in constructive analysis.
- Specification of real-time and hybrid systems in rewriting logic
- Inaccessible set axioms may have little consistency strength
- Arithmetical conservation results
- To be or not to be constructive, that is not the question
- A note on non-classical nonstandard arithmetic
- Consistency of the intensional level of the minimalist foundation with Church's thesis and axiom of choice
- Axioms for strict and lazy functional programs
- Intuitionistic sequential compactness?
- A theory of rules for enumerated classes of functions
- A semantical proof of De Jongh's theorem
- Can constructive mathematics be applied in physics?
- Towards a computation system based on set theory
- Constructing extensions of ultraweakly continuous linear functionals
- Realization of constructive set theory into explicit mathematics: A lower bound for impredicative Mahlo universe
- Apartness spaces as a framework for constructive topology
- Universes over Frege structures
- Computational complexity of optimization and crude range testing: A new approach motivated by fuzzy optimization
- Nominal logic, a first order theory of names and binding
- A constructive approach to nonstandard analysis
- Totality in applicative theories
- Spectra of selfadjoint operators in constructive analysis
- Systems of explicit mathematics with non-constructive -operator. II
- Paradox and potential infinity
- Reverse mathematics of topology: dimension, paracompactness, and splittings
- Induction, constructivity, and grounding
- Proofs and retributions, or: why Sarah can't take limits
- Deflationism beyond arithmetic
- The paradox of phase transitions in the light of constructive mathematics
- Reverse formalism 16
- Predicativity and constructive mathematics
- A categorical reading of the numerical existence property in constructive foundations
- Algebras of complemented subsets
- A new model construction by making a detour via intuitionistic theories. III: Ultrafinitistic proofs of conservations of \(\Sigma_1^1\) collection
- Constructive mathematics, Church's thesis, and free choice sequences
- Representations and the foundations of mathematics
- Tableaux for free logics with descriptions
- Justification logic and type theory as formalizations of intuitionistic propositional logic
- Betwixt Turing and Kleene
- Between Turing and Kleene
- Satisfiability is false intuitionistically: a question from Dana Scott
- Free logics are cut-free
- Toward a clarity of the extreme value theorem
- A Kuroda-style \(j\)-translation
- A flexible type system for the small Veblen ordinal
- On Goodman realizability
- A new model construction by making a detour via intuitionistic theories. II: Interpretability lower bound of Feferman's explicit mathematics \(T_0\)
- Applicative theories for logarithmic complexity classes
- Constructibility of the universal wave function
- Metamathematical properties of a constructive multi-typed theory
- A Burgessian critique of nominalistic tendencies in contemporary mathematics and its historiography
- Equivalence of bar induction and bar recursion for continuous functions with continuous moduli
- Representing definable functions of \(\mathrm{HA}^{\omega}\) by neighbourhood functions
- Montague's paradox, informal provability, and explicit modal logic
- On Feferman's operational set theory \textsf{OST}
- Abstraction in algorithmic logic
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3679172)
