Logical foundations for programming semantics

DOI10.1016/0304-3975(93)90189-ZzbMath0786.03021OpenAlexW1979462910MaRDI QIDQ685420

George K. Tsiknis, Paul C. Gilmore

Publication date: 5 May 1994

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

Full work available at URL: https://doi.org/10.1016/0304-3975(93)90189-z

zbMATH Keywords

recursive definitionsnatural-deduction logicnatural-deduction-based set theoryprogramming semantics

Mathematics Subject Classification ID

Logic in computer science (03B70) Semantics in the theory of computing (68Q55) Nonclassical and second-order set theories (03E70)

Related Items (1)

A logic for category theory

Cites Work

• A logic for category theory
• Monotone mappings of manifolds. II
• Logic, sets, and mathematics
• An axiomatic proof technique for parallel programs
• Power domains
• Natural deduction based set theories: a new resolution of the old paradoxes
• Mathematical Applications of Category Theory
• Toward useful type-free theories. I
• On the power of list iteration
• A Powerdomain Construction
• Communicating sequential processes
• An axiomatic basis for computer programming
• 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
• 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: Logical foundations for programming semantics