A logic of recursion

DOI10.1016/0890-5401(89)90069-2zbMath0686.03020OpenAlexW1995638390MaRDI QIDQ1262303

Gianfranco Mascari, V. Michele Abrusci

Publication date: 1989

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0890-5401(89)90069-2

zbMATH Keywords

axiomatization in terms of modified Girard's \(\beta\)-logiclanguage for partial functions on arbitrary structures

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Abstract and axiomatic computability and recursion theory (03D75)

Cites Work

• Equivalences among logics of programs
• While-programs with nondeterministic assignments and the logic ALNA
• Proving total correctness of nondeterministic programs in infinitary logic
• On specifications, theories, and models with higher types
• A programming language for the inductive sets, and applications
• Countable nondeterminism and random assignment
• Π12-logic, Part 1: Dilators
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A logic of recursion