Functional completeness of cartesian categories
DOI10.1016/0003-4843(74)90003-5zbMATH Open0282.18004OpenAlexW2055942509WikidataQ60019634 ScholiaQ60019634MaRDI QIDQ4767105FDOQ4767105
Publication date: 1974
Published in: Annals of Mathematical Logic (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0003-4843(74)90003-5
Classical first-order logic (03B10) Intermediate logics (03B55) Monads (= standard construction, triple or triad), algebras for monads, homology and derived functors for monads (18C15) Closed categories (closed monoidal and Cartesian closed categories, etc.) (18D15) Foundations, relations to logic and deductive systems (18A15)
Cited In (25)
- Composition of deductions within the propositions-as-types paradigm
- Functional completeness of the free locally Cartesian closed category and interpretations of Martin-Löf's theory of dependent types
- Title not available (Why is that?)
- Algebra of constructions. I. The word problem for partial algebras
- Models of deduction
- Title not available (Why is that?)
- From types to sets
- Inferential Semantics
- Intuitionist type theory and foundations
- Identity of Proofs Based on Normalization and Generality
- Aspects of Categorical Recursion Theory
- Deductive Completeness
- Pre-recursive categories
- Title not available (Why is that?)
- Title not available (Why is that?)
- Least fixpoints of endofunctors of cartesian closed categories
- On Church's formal theory of functions and functionals. The \(\lambda\)- calculus: Connections to higher type recursion theory, proof theory, category theory
- The Deduction Theorem (Before and After Herbrand)
- Programs, Grammars and Arguments: A Personal View of some Connections between Computation, Language and Logic
- Intuitionist type theory and the free topos
- Title not available (Why is that?)
- Representing definable functions of \(\mathrm{HA}^{\omega}\) by neighbourhood functions
- Closure functions and general iterates as reflectors
- Decomposing typed lambda calculus into a couple of categorical programming languages
- Polycategories
This page was built for publication: Functional completeness of cartesian categories
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4767105)
