Two over three: a two-valued logic for software specification and validation over a three-valued predicate calculus

DOI10.1080/11663081.1993.10510795zbMath0802.03028OpenAlexW2006565521MaRDI QIDQ4275696

Beata Konikowska

Publication date: 12 December 1994

Published in: Journal of Applied Non-Classical Logics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/11663081.1993.10510795

zbMATH Keywords

proof theorysemanticsexpressive powersoftware specificationsoftware validationsuperpredicatetwo-valued predicates over three- valued predicates

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Other applications of logic (03B80)

Related Items (5)

Analytic tableaux for non-deterministic semantics ⋮ Are the logical foundations of verifying compiler prototypes matching user expectations? ⋮ Rough sets and 3-valued logics ⋮ Proof systems for reasoning about computation errors ⋮ Rasiowa-Sikorski deduction systems in computer science applications.

Uses Software

• Mizar

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The foundations of mathematics. A study in the philosophy of science
• A logic covering undefinedness in program proofs
• Partial-predicate logic in computer science
• MetaSoft primer. Towards a metalanguage for applied denotational semantics
• The clean termination of iterative programs
• On a Formalization of the Non-Definedness Notion
• A PARTIAL PREDICATE CALCULUS IN A TWO-VALUED LOGIC
• On the Development of Correct Specified Programs

This page was built for publication: Two over three: a two-valued logic for software specification and validation over a three-valued predicate calculus