scientific article; zbMATH DE number 1289305

No author found.

Publication date: 24 May 1999

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

textbook posets lattices category theory foundations of mathematics structural recursion adjunction between syntax and semantics syntactic category of a theory

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to mathematical logic and foundations (03-01) Methodology of mathematics (00A35) Mathematics in general (00A05) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to category theory (18-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to ordered structures (06-01)

Related Items (53)

Remarks on the tripos to topos construction: comprehension, extensionality, quotients and functional-completeness ⋮ Logic of Intuitionistic Interactive Proofs (Formal Theory of Perfect Knowledge Transfer) ⋮ Logic of negation-complete interactive proofs (formal theory of epistemic deciders) ⋮ Semantic analysis of normalisation by evaluation for typed lambda calculus ⋮ Distributivity of categories of coalgebras ⋮ Computational adequacy for recursive types in models of intuitionistic set theory ⋮ Initial algebras and final coalgebras consisting of nondeterministic finite trace strategies ⋮ Kernels, in a nutshell ⋮ Ordinals in Frobenius monads ⋮ Bicategories in univalent foundations ⋮ Relations on Hypergraphs ⋮ Understanding one another: making out meanings with Boolean equations ⋮ Quotient completion for the foundation of constructive mathematics ⋮ Triposes, exact completions, and Hilbert's \(\varepsilon\)-operator ⋮ A Categorical Aspect of the Analogy Between Quantifiers and Modalities ⋮ What is a finitely related object, categorically? ⋮ A new framework for declarative programming ⋮ Identity types and weak factorization systems in Cauchy complete categories ⋮ Bicategorical type theory: semantics and syntax ⋮ Recursive coalgebras of finitary functors ⋮ Well-founded coalgebras, revisited ⋮ Relative full completeness for bicategorical Cartesian closed structure ⋮ Type-theoretic approaches to ordinals ⋮ Filter pairs and natural extensions of logics ⋮ Unnamed Item ⋮ PICK TWO POINTS IN A TREE ⋮ Intuitionistic sets and ordinals ⋮ Darboux calculus ⋮ The Biequivalence of Locally Cartesian Closed Categories and Martin-Löf Type Theories ⋮ General Refinement, Part Two: Flexible Refinement ⋮ The identity type weak factorisation system ⋮ CPO semantics of timed interactive actor networks ⋮ Contexts, refinement and determinism ⋮ The biequivalence of locally cartesian closed categories and Martin-Löf type theories ⋮ Extending conceptualisation modes for generalised formal concept analysis ⋮ Recursive coalgebras from comonads ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Proof theory in the abstract ⋮ Kleisli morphisms and randomized congruences for the Giry monad ⋮ Semi-abelian categories ⋮ Parameterised notions of computation ⋮ Quantum Logic in Dagger Kernel Categories ⋮ Two-dimensional models of type theory ⋮ The Dedekind reals in abstract Stone duality ⋮ Localization, monoid sets and \(K\)-theory ⋮ A categorical framework for learning generalised tree automata ⋮ Symmetric Heyting relation algebras with applications to hypergraphs ⋮ Generic Tools via General Refinement ⋮ M-shaped and other exotic solitons generated by cubic-quintic saturable nonlinearities in a nonlinear electrical transmission network with higher-order dispersion effects ⋮ Map composition generalized to coherent collections of maps.

This page was built for publication: