A logic of recursion
From MaRDI portal
Publication:1262303
DOI10.1016/0890-5401(89)90069-2zbMath0686.03020MaRDI QIDQ1262303
V. Michele Abrusci, Gianfranco Mascari
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
axiomatization in terms of modified Girard's \(\beta\)-logic; language for partial functions on arbitrary structures
03B70: Logic in computer science
68Q60: Specification and verification (program logics, model checking, etc.)
03D75: Abstract and axiomatic computability and recursion theory
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