scientific article

zbMath1035.03001MaRDI QIDQ2753183

No author found.

Publication date: 29 October 2001

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

zbMATH Keywords

complexityHandbookcategorical logiclogic in computer scienceabstract data types

Mathematics Subject Classification ID

Logic in computer science (03B70) Abstract data types; algebraic specification (68Q65) Categorical logic, topoi (03G30) Complexity of computation (including implicit computational complexity) (03D15) Categorical semantics of formal languages (18C50) Second- and higher-order arithmetic and fragments (03F35) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to computer science (68-00) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to mathematical logic and foundations (03-00) Abstract and axiomatic computability and recursion theory (03D75)

Related Items (23)

Nominal lambda calculus: an internal language for FM-Cartesian closed categories ⋮ Modeling Martin-Löf type theory in categories ⋮ A stone-type duality theorem for separation logic via its underlying bunched logics ⋮ Equational logic and categorical semantics for multi-languages ⋮ Game semantics for dependent types ⋮ Universality and semicomputability for nondeterministic programming languages over abstract algebras ⋮ Representing definable functions of \(\mathrm{HA}^{\omega}\) by neighbourhood functions ⋮ Dependently Sorted Logic ⋮ Fibered universal algebra for first-order logics ⋮ First-order logic in the Medvedev lattice ⋮ Programming Experimental Procedures for Newtonian Kinematic Machines ⋮ A characterization of those categories whose internal logic is Hilbert's \(\varepsilon\)-calculus ⋮ Indexed and fibred structures for Hoare logic ⋮ Elementary doctrines as coalgebras ⋮ Oracles and Advice as Measurements ⋮ Kolmogorov Complexity Theory over the Reals ⋮ Combinatorial structure of type dependency ⋮ The simplicial model of univalent foundations (after Voevodsky) ⋮ Model structures on categories of models of type theories ⋮ ETA-RULES IN MARTIN-LÖF TYPE THEORY ⋮ Joyal's arithmetic universes via type theory ⋮ Computable scalar fields: A basis for PDE software ⋮ FIBRED ALGEBRAIC SEMANTICS FOR A VARIETY OF NON-CLASSICAL FIRST-ORDER LOGICS AND TOPOLOGICAL LOGICAL TRANSLATION

This page was built for publication: