On a Formalization of the Non-Definedness Notion

DOI10.1002/malq.19790251304zbMath0415.03019OpenAlexW2031155999MaRDI QIDQ3050399

Albert Hoogewijs

Publication date: 1979

Published in: Zeitschrift für Mathematische Logik und Grundlagen der Mathematik (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/malq.19790251304

zbMATH Keywords

forcingmodel theorymany-valued logicomitting types theoremBrandt groupoiddeduction calculusformalization of the non- definedness notiongeneric model theoremnonclassical formal systems

Mathematics Subject Classification ID

Model-theoretic algebra (03C60) Other nonclassical logic (03B60) Model theory (03C99) Many-valued logic (03B50) Groupoids (i.e. small categories in which all morphisms are isomorphisms) (20L05)

Related Items (13)

Partial-predicate logic in computer science ⋮ A simple sequent calculus for partial functions ⋮ Two over three: a two-valued logic for software specification and validation over a three-valued predicate calculus ⋮ A guided tour of the mathematics of MetaSoft '88 ⋮ On finite-valued propositional logical calculi ⋮ The non-definability notion and first order logic ⋮ Meeting of the Association for Symbolic Logic, Stanford, California, 1985 ⋮ Efficient Well-Definedness Checking ⋮ Meeting of the Association for Symbolic Logic, Marseilles, 1981 (the Herbrand Symposium) ⋮ European Summer Meeting of the Association for Symbolic Logic, Hull, 1986 ⋮ 2002 European Summer Meeting of the Association for Symbolic Logic Logic Colloquium '02 ⋮ A logic covering undefinedness in program proofs ⋮ Meeting of the Association for Symbolic Logic Florence, Italy 1982

This page was built for publication: On a Formalization of the Non-Definedness Notion