scientific article; zbMATH DE number 3825806

Cited in

(only showing first 100 items - show all)

Basic subtoposes of the effective topos
Aspects of categorical recursion theory
On the failure of fixed-point theorems for chain-complete lattices in the effective topos
On Tarski’s fixed point theorem
A higher-order calculus and theory abstraction
Aspects of predicative algebraic set theory. II: Realizability
Realizability algebras III: some examples
Defining effectiveness using finite sets. A study on computability
Functorial polymorphism
Filtered colimits in the effective topos
A minimalist two-level foundation for constructive mathematics
A modest model of records, inheritance, and bounded quantification
Remarks on the tripos to topos construction: comprehension, extensionality, quotients and functional-completeness
Comparing free algebras in topological and classical domain theory
Partial morphisms in categories of effective objects
Relative completions
Aspects of predicative algebraic set theory. I: Exact completion
The modified realizability topos
The category of implicative algebras and realizability
Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 5--11, 2017
Lawvere-Tierney topologies for computability theorists
``Upon this quote I will build my Church thesis
On categorical structures arising from implicative algebras: from topology to assemblies
Ideal presentations and numberings of some classes of effective quasi-Polish spaces
On the Weihrauch degree of the additive Ramsey theorem
On the first-order parts of problems in the Weihrauch degrees
On the failure of fixed-point theorems for chain-complete lattices in the effective topos
Some free constructions in realizability and proof theory
Axiomatizing higher-order Kleene realizability
Mathematical logic: proof theory, constructive mathematics. Abstracts from the workshop held November 8--14, 2020 (hybrid meeting)
A characterization of generalized existential completions
What should a generic object be?
A categorial approach to the theory of computation
Computable queries for object oriented databases
Computational adequacy for recursive types in models of intuitionistic set theory
A model for intuitionistic non-standard arithmetic
A constructive manifestation of the Kleene-Kreisel continuous functionals
A homotopy-theoretic model of function extensionality in the effective topos
From constructivism to computer science
Integrating classical and intuitionistic type theory
Coinduction in Flow: The Later Modality in Fibrations
The effects of effects on constructivism
Consistency of the intensional level of the minimalist foundation with Church's thesis and axiom of choice
From term models to domains
Hilbert's tenth problem for term algebras with a substitution operator
Defining long words succinctly in FO and MSO
Introduction to Turing categories
Groupoidal realizability for intensional type theory
Complemented subsets and Boolean-valued, partial functions
Algorithmically random series
Lower bounds on () and other properties of -register machines
Reifying dynamical algebra: maximal ideals in countable rings, constructively
Metric spaces in synthetic topology
A survey of fuzzy set and topos theory
Realizability with a local operator of A. M. Pitts
A proposed categorical semantics for pure ML
Five stages of accepting constructive mathematics
scientific article; zbMATH DE number 7003193 (Why is no real title available?)
Categorical models of subtyping
Categories for collection monads
Axioms and (counter)examples in synthetic domain theory
Triposes, exact completions, and Hilbert's \(\varepsilon\)-operator
A denotationally-based program logic for higher-order store
Realizability in ordered combinatory algebras with adjunction
Parametric Church's thesis: synthetic computability without choice
A category-theoretic characterization of functional completeness
A partial metric semantics of higher-order types and approximate program transformations
μ-Bicomplete Categories and Parity Games
Uniform Elgot iteration in foundations
Recursion over realizability structures
The effective model structure and \(\infty\)-groupoid objects
Realizing Brouwer's sequences
Game semantics of Martin-Löf type theory
Parallelism in realizability models
Towards univalent reference types: the impact of univalence on denotational semantics
Local operators in topos theory and separation of semi-classical axioms in intuitionistic arithmetic
Effectiveness and continuity in intuitionistic quasi-toposes of assemblies
Ordered combinatory algebras and realizability
On (co)products of partial combinatory algebras, with an application to pushouts of realizability toposes
Equilogical spaces
Extensional PERs
scientific article; zbMATH DE number 7561492 (Why is no real title available?)
Monoidal computer. III: A coalgebraic view of computability and complexity (extended abstract)
A small complete category
On fixed-point theorems in synthetic computability
Finiteness and computation in toposes
Toward the effective 2-topos
Kleene computable functionals and the higher order existence property
On Church's formal theory of functions and functionals. The - calculus: Connections to higher type recursion theory, proof theory, category theory
Aczel-Mendler bisimulations in a regular category
Internal enriched categories
A topos for extended Weihrauch degrees
Domain theoretic models of polymorphism
The category of equilogical spaces and the effective topos as homotopical quotients
Extensional realizability
Differential equations in constructive analysis and in the recursive realizability topos
On completeness and cocompleteness in and around small categories
An exper model for Quest
Exploring mathematical objects from custom-tailored mathematical universes
Changing the logic without changing the subject: the case of computability

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 Q3671978)