On a Formalization of the Non-Definedness Notion
From MaRDI portal
Cited in
(13)- Partial-predicate logic in computer science
- A guided tour of the mathematics of MetaSoft '88
- The non-definability notion and first order logic
- On finite-valued propositional logical calculi
- A simple sequent calculus for partial functions
- European Summer Meeting of the Association for Symbolic Logic, Hull, 1986
- Meeting of the Association for Symbolic Logic, Marseilles, 1981 (the Herbrand Symposium)
- Efficient Well-Definedness Checking
- Meeting of the Association for Symbolic Logic Florence, Italy 1982
- Meeting of the Association for Symbolic Logic, Stanford, California, 1985
- Two over three: a two-valued logic for software specification and validation over a three-valued predicate calculus
- 2002 European Summer Meeting of the Association for Symbolic Logic Logic Colloquium '02
- A logic covering undefinedness in program proofs
This page was built for publication: On a Formalization of the Non-Definedness Notion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3050399)