Between constructive mathematics and PROLOG

DOI10.1007/BF01621473zbMath0754.68029OpenAlexW2324570056MaRDI QIDQ1173742

Gerhard Jäger

Publication date: 25 June 1992

Published in: Archive for Mathematical Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01621473

zbMATH Keywords

surveyconstructive mathematicsconstructive type theorylogic programminglambda calculusnegative informationprovability theory

Mathematics Subject Classification ID

Logic programming (68N17) Other constructive mathematics (03F65) Second- and higher-order arithmetic and fragments (03F35) Combinatory logic and lambda calculus (03B40) Gödel numberings and issues of incompleteness (03F40)

Uses Software

• Automath

Cites Work

• The semantics of second-order lambda calculus
• Propositions and specifications of programs in Martin-Löf's type theory
• On the satisfiability of circumscription
• Closed-world databases and circumscription
• The system \({\mathcal F}\) of variable types, fifteen years later
• Circumscription - a form of non-monotonic reasoning
• Iterated inductive definitions and subsystems of analysis: recent proof-theoretical studies
• Constructivism in mathematics. An introduction. Volume II
• A sound and complete semantics for a version of negation as failure
• Canonical logic programs
• Negation in logic programming
• The defining power of stratified and hierarchical logic programs
• Proof theory
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Between constructive mathematics and PROLOG