Pages that link to "Item:Q1188500"
From MaRDI portal
The following pages link to Constructivism in mathematics. An introduction. Volume I (Q1188500):
Displaying 50 items.
- Finitary formal topologies and Stone's representation theorem (Q949607) (← links)
- Resolution is cut-free (Q972424) (← links)
- Kripke models, distributive lattices, and Medvedev degrees (Q995672) (← links)
- A constructive theory of continuous domains suitable for implementation (Q1023289) (← links)
- A minimalist two-level foundation for constructive mathematics (Q1032635) (← links)
- CPS-translation as adjoint (Q1044830) (← links)
- Language in action (Q1177646) (← links)
- Constructive \(\lambda\)-models (Q1192622) (← links)
- On the structure of paradoxes (Q1204111) (← links)
- Constructing best approximations on a Jordan curve (Q1270276) (← links)
- Computable Kripke models and intermediate logics (Q1271561) (← links)
- Truth, proof and infinity. A theory of constructions and constructive reasoning (Q1273591) (← links)
- Constructive mathematics: a foundation for computable analysis (Q1292399) (← links)
- Defining concurrent processes constructively (Q1314421) (← links)
- Systems of explicit mathematics with non-constructive \(\mu\)-operator. I (Q1314542) (← links)
- Realizability interpretation of generalized inductive definitions (Q1331920) (← links)
- Formalizing non-termination of recursive programs (Q1349246) (← links)
- Algebraic proofs of cut elimination (Q1349247) (← links)
- Extensional realizability (Q1356980) (← links)
- Propositional lax logic (Q1368378) (← links)
- A constructive formulation of Gleason's theorem (Q1372943) (← links)
- Specification of abstract dynamic-data types: A temporal logic approach (Q1391733) (← links)
- Coherence for sharing proof-nets (Q1398472) (← links)
- A new framework for declarative programming (Q1399960) (← links)
- On the strong normalisation of intuitionistic natural deduction with permutation-conversions (Q1400711) (← links)
- A proof-theoretic investigation of a logic of positions (Q1408856) (← links)
- Intuitionistic axiomatizations for bounded extension Kripke models. (Q1412839) (← links)
- Reverse mathematics and completeness theorems for intuitionistic logic (Q1422103) (← links)
- Unique existence, approximate solutions, and countable choice. (Q1427789) (← links)
- A constructive theory of point-set nearness. (Q1427791) (← links)
- Theories with self-application and computational complexity. (Q1427856) (← links)
- Reduction of finite and infinite derivations (Q1577482) (← links)
- The non-constructive \(\mu\) operator, fixed point theories with ordinals, and the bar rule (Q1577487) (← links)
- Kernels of seminorms in constructive analysis. (Q1607290) (← links)
- Constructive agents (Q1688949) (← links)
- Lewis meets Brouwer: constructive strict implication (Q1688950) (← links)
- Constructive knowledge and the justified true belief paradigm (Q1688952) (← links)
- Arithmetical conservation results (Q1688961) (← links)
- Questions as information types (Q1708968) (← links)
- A note on non-classical nonstandard arithmetic (Q1715475) (← links)
- A continuity principle equivalent to the monotone \(\Pi^0_1\) fan theorem (Q1734272) (← links)
- A semantic hierarchy for intuitionistic logic (Q1740610) (← links)
- Safe beliefs for propositional theories (Q1779312) (← links)
- The admissible rules of \(\mathsf{BD}_2\) and \(\mathsf{GSc}\) (Q1782237) (← links)
- Intuitionistic sequential compactness? (Q1788329) (← links)
- On Brouwer's continuity principle (Q1788331) (← links)
- Subintuitionistic logics and the implications they prove (Q1788333) (← links)
- The creating subject, the Brouwer-Kripke schema, and infinite proofs (Q1788337) (← links)
- Constructing extensions of ultraweakly continuous linear functionals (Q1840580) (← links)
- A sequent calculus for subtyping polymorphic types (Q1854408) (← links)
