Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

scientific article

From MaRDI portal
Publication:2852343
Jump to:navigation, search

zbMath1273.03144MaRDI QIDQ2852343

Andrej Bauer

Publication date: 8 October 2013

Full work available at URL: http://www.sciencedirect.com/science/article/pii/S1571066106001861

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


Mathematics Subject Classification ID

Categorical logic, topoi (03G30) Other constructive mathematics (03F65) General topics in the theory of computing (68Q01) Abstract and axiomatic computability and recursion theory (03D75)


Related Items (8)

Parametric Church's thesis: synthetic computability without choice ⋮ On fixed-point theorems in synthetic computability ⋮ Weak call-by-value lambda calculus as a model of computation in Coq ⋮ Constructive Many-one Reduction from the Halting Problem to Semi-unification (Extended Version) ⋮ Synthetic undecidability and incompleteness of first-order axiom systems in Coq. Extended version ⋮ Type-theoretic approaches to ordinals ⋮ Metric spaces in synthetic topology ⋮ Call-by-value lambda calculus as a model of computation in Coq







This page was built for publication:

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2852343&oldid=15784854"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 19:22.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki