scientific article
From MaRDI portal
Publication:3671978
zbMath0522.03055MaRDI QIDQ3671978
Publication date: 1982
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Church's thesisintuitionistic logicMarkov's principleeffective toposrecursive realizabilityrealizability toposes
Related Items
Remarks on the tripos to topos construction: comprehension, extensionality, quotients and functional-completeness, Filtered colimits in the effective topos, Relative completions, μ-Bicomplete Categories and Parity Games, Axiomatizing higher-order Kleene realizability, A constructive manifestation of the Kleene-Kreisel continuous functionals, The effects of effects on constructivism, Computational adequacy for recursive types in models of intuitionistic set theory, A model for intuitionistic non-standard arithmetic, Realizability and recursive set theory, The S-replete construction, On completeness and cocompleteness in and around small categories, A Minimalist Foundation at Work, A higher-order calculus and theory abstraction, Extensional realizability, Parametric Church's thesis: synthetic computability without choice, Kleene computable functionals and the higher order existence property, Some free constructions in realizability and proof theory, Partial morphisms in categories of effective objects, A small complete category, On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory, Realizing Brouwer's sequences, Relating first-order set theories, toposes and categories of classes, On Tarski’s fixed point theorem, Basic subtoposes of the effective topos, Dictoses, Triposes, exact completions, and Hilbert's \(\varepsilon\)-operator, On fixed-point theorems in synthetic computability, Internal enriched categories, An exper model for Quest, The category of implicative algebras and realizability, A characterization of generalized existential completions, On categorical structures arising from implicative algebras: from topology to assemblies, On the failure of fixed-point theorems for chain-complete lattices in the effective topos, Realizability algebras III: some examples, What should a generic object be?, Game semantics of Martin-Löf type theory, Parallelism in realizability models, A categorial approach to the theory of computation, Unnamed Item, Ordered combinatory algebras and realizability, A category-theoretic characterization of functional completeness, Five stages of accepting constructive mathematics, Characterizing partitioned assemblies and realizability toposes, A modest model of records, inheritance, and bounded quantification, Metric spaces in synthetic topology, Realizability in ordered combinatory algebras with adjunction, Recursion over realizability structures, A survey of fuzzy set and topos theory, Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 5--11, 2017, Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 8--14, 2020 (hybrid meeting), Coinduction in Flow: The Later Modality in Fibrations, The category of equilogical spaces and the effective topos as homotopical quotients, Univalent polymorphism, The modified realizability topos, On (co)products of partial combinatory algebras, with an application to pushouts of realizability toposes, Extensional PERs, A PREDICATIVE VARIANT OF HYLAND’S EFFECTIVE TOPOS, Aspects of predicative algebraic set theory. I: Exact completion, Computable Queries for Object Oriented Databases, Consistency of the intensional level of the minimalist foundation with Church's thesis and axiom of choice, Defining effectiveness using finite sets. A study on computability, Realizability with a local operator of A. M. Pitts, Comparing free algebras in topological and classical domain theory, Aspects of predicative algebraic set theory. II: Realizability, Integrating classical and intuitionistic type theory, Unnamed Item, Introduction to Turing categories, A proposed categorical semantics for Pure ML, Monoidal computer III: a coalgebraic view of computability and complexity (extended abstract), On the Failure of Fixed-Point Theorems for Chain-complete Lattices in the Effective Topos, Functorial polymorphism, From constructivism to computer science, From term models to domains, Domain theoretic models of polymorphism, A minimalist two-level foundation for constructive mathematics, Equilogical spaces, Unnamed Item, Axioms and (counter)examples in synthetic domain theory, Exploring mathematical objects from custom-tailored mathematical universes, A homotopy-theoretic model of function extensionality in the effective topos, Differential equations in constructive analysis and in the recursive realizability topos, Aspects of Categorical Recursion Theory, The effective model structure and -groupoid objects, Lawvere-Tierney topologies for computability theorists
