Constructive natural deduction and its ‘ω-set’ interpretation
From MaRDI portal
(Redirected from Publication:4006232)
Recommendations
- scientific article; zbMATH DE number 3902624
- Natural deduction for Post's logics and their duals
- Natural deduction based set theories: a new resolution of the old paradoxes
- scientific article; zbMATH DE number 2024631
- Natural deduction and sequent calculus for intuitionistic relevant logic
- On natural deduction for Herbrand constructive logics. III: The strange case of the intuitionistic logic of constant domains
- Natural deduction for generalized quantifiers
- Finitely many-valued logics and natural deduction
- Natural deduction for paraconsistent logic
- A natural deduction and its corresponding sequent calculus for positive contraction-less relevant logic
Cites work
- A filter lambda model and the completeness of type assignment
- A theory of type polymorphism in programming
- Automatic synthesis of typed -programs on term algebras
- Completeness of type assignment in continuous lambda models
- Computability in higher types, P and the completeness of type assignment
- Data Types as Lattices
- scientific article; zbMATH DE number 4148056 (Why is no real title available?)
- scientific article; zbMATH DE number 3993540 (Why is no real title available?)
- Intuitionist type theory and the free topos
- LCF considered as a programming language
- Polymorphic type inference and containment
- The completeness theorem for typing lambda-terms
- The Discrete Objects in the Effective Topos
- The Principal Type-Scheme of an Object in Combinatory Logic
Cited in
(31)- From exact sciences to life phenomena: Following Schrödinger and Turing on programs, life and causality
- On Church's formal theory of functions and functionals. The - calculus: Connections to higher type recursion theory, proof theory, category theory
- A two-storied universe of transfinite mechanisms
- Categorical models of polymorphism
- Comprehension categories and the semantics of type dependency
- From constructivism to computer science
- Formal parametric polymorphism
- The genericity theorem and parametricity in the polymorphic \(\lambda\)- calculus
- Constructive sets in computable sets
- Covariant types
- Revisiting the notion of function
- A computable expression of closure to efficient causation
- Maps. I: Relative to a factorisation system
- On completeness and cocompleteness in and around small categories
- Natural deduction based set theories: a new resolution of the old paradoxes
- Internal models of system F for decompilation
- A simple model construction for the calculus of constructions
- scientific article; zbMATH DE number 3999882 (Why is no real title available?)
- The S-replete construction
- Cubical assemblies, a univalent and impredicative universe and a failure of propositional resizing
- Computability structures, simulations and realizability
- Semantics of constructions. I: The traditional approach
- Bifibrational functorial semantics of parametric polymorphism
- Conservativity between logics and typed λ calculi
- Classical predicative logic-enriched type theories
- Relations in operational categories
- Conservativity of type theory over higher-order arithmetic
- Functorial polymorphism
- An exactification of the monoid of primitive recursive functions
- Alpha conversion, conditions on variables and categorical logic
- A modest model of records, inheritance, and bounded quantification
This page was built for publication: Constructive natural deduction and its ‘ω-set’ interpretation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4006232)
