A first order logic for partial functions

DOI10.1016/0304-3975(90)90005-3zbMath0707.03021OpenAlexW2064078503MaRDI QIDQ918965

Antonio Gavilanes-Franco, Francisca Lucio-Carrasco

Publication date: 1990

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(90)90005-3

zbMATH Keywords

sequent calculuslogic for partial functionsBeth's tableaux methodformal reasoning on programspartial predicates

Mathematics Subject Classification ID

Logic in computer science (03B70) Semantics in the theory of computing (68Q55)

Related Items (5)

A simple sequent calculus for partial functions ⋮ Typical forcings, NP search problems and an extension of a theorem of Riis ⋮ A completeness proof for a regular predicate logic with undefined truth value ⋮ Inversive meadows and divisive meadows ⋮ Partial logics reconsidered: A conservative approach

Cites Work

• A logic covering undefinedness in program proofs
• Partial-predicate logic in computer science
• Partial models and logic programming
• Partial abstract types
• Mathematical thought. An introduction to the philosophy of mathematics
• A kripke-kleene semantics for logic programs*
• Algorithmic specifications: a constructive specification method for abstract data types
• The Calculus of Partial Predicates and Its Extension to Set Theory I
• Über Eine Prädikatenlogik mit Partiell Definierten Prädikaten und Funktionen
• Unnamed Item
• Unnamed Item
• 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: A first order logic for partial functions