Partial-predicate logic in computer science (Q1079560): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A logic covering undefinedness in program proofs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Introduction to mathematical logic. Translated from the German by Diana Schmidt / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On a Formalization of the Non-Definedness Notion / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A PARTIAL PREDICATE CALCULUS IN A TWO-VALUED LOGIC / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 15:19, 17 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Partial-predicate logic in computer science |
scientific article |
Statements
Partial-predicate logic in computer science (English)
0 references
1987
0 references
In [Acta Inf. 21, 251-269 (1984; Zbl 0534.68024)] \textit{H. Barringer}, \textit{J. H. Cheng} and \textit{C. B. Jones} present a 3-valued logic designed for program verification and computer science applications in general. This paper adds some theoretical background to their arguments for the need for such a system.
0 references
correctness of programs
0 references
3-valued logic
0 references
program verification
0 references