On the public citation graph

Partial-predicate logic in computer science

https://doi.org/10.1007/bf00292109
0 signed · 26 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1002/malq.19790251304openalex-snapshot
On a Formalization of the Non‐Definedness Notion
inferredcites →https://doi.org/10.1002/malq.19830290410openalex-snapshot
A PARTIAL PREDICATE CALCULUS IN A TWO‐VALUED LOGIC
inferredcites →https://doi.org/10.1007/978-3-642-87132-0openalex-snapshot
Introduction to Mathematical Logic
inferredcites →https://doi.org/10.1007/bf00264250openalex-snapshot
A logic covering undefinedness in program proofs

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/3-540-50214-9_19openalex-snapshot
A three-valued logic for software specification and validation
inferred← citeshttps://doi.org/10.1007/3-540-50214-9_20openalex-snapshot
Three-valued predicates for software specification and validation
inferred← citeshttps://doi.org/10.1007/3-540-54345-7_71openalex-snapshot
Two over three: a two-valued logic for software specification and validation over a three-valued predicate calculus
inferred← citeshttps://doi.org/10.1007/3-540-56992-8_12openalex-snapshot
Reasoning with higher order partial functions
inferred← citeshttps://doi.org/10.1007/978-3-642-30885-7_18openalex-snapshot
A Semantic Analysis of Logics That Cope with Partial Terms
inferred← citeshttps://doi.org/10.1007/978-3-642-41071-0_3openalex-snapshot
Unifying Theories of Logic and Specification
inferred← citeshttps://doi.org/10.1007/bf01135375openalex-snapshot
Reasoning about partial functions with the aid of a computer
inferred← citeshttps://doi.org/10.1007/bf01211555openalex-snapshot
Partial logics reconsidered: A conservative approach
inferred← citeshttps://doi.org/10.1007/bfb0028972openalex-snapshot
A first order logic for partial functions
inferred← citeshttps://doi.org/10.1007/bfb0029619openalex-snapshot
A first-order logic for partial recursive functions
inferred← citeshttps://doi.org/10.1007/s11225-009-9175-4openalex-snapshot
Proof Systems for Reasoning about Computation Errors
inferred← citeshttps://doi.org/10.1016/0020-0190(88)90033-6openalex-snapshot
A guided tour of the mathematics of Metasoft'88
inferred← citeshttps://doi.org/10.1016/0304-3975(90)90005-3openalex-snapshot
A first order logic for partial functions
inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50020-2openalex-snapshot
Methods and Logics for Proving Programs
inferred← citeshttps://doi.org/10.1016/s0020-0255(98)10062-2openalex-snapshot
The non-definedness notion in expert systems
inferred← citeshttps://doi.org/10.1080/11663081.1993.10510795openalex-snapshot
Two over three: a two-valued logic for software specification and validation over a three-valued predicate calculus
inferred← citeshttps://doi.org/10.1093/comjnl/42.2.73openalex-snapshot
Adapting Calculational Logic to the Undefined
inferred← citeshttps://doi.org/10.1109/ismvl.2001.924572openalex-snapshot
Automated reasoning with ordinary assertions and default assumptions
inferred← citeshttps://doi.org/10.1109/mahc.2003.1203057openalex-snapshot
The early search for tractable ways of reasoning about programs
inferred← citeshttps://doi.org/10.2178/bsl/1146620064openalex-snapshot
2005 Summer Meeting of the Association for Symbolic Logic. Logic Colloquium '05
inferred← citeshttps://doi.org/10.2307/421141openalex-snapshot
1998 European Summer Meeting of the Association for Symbolic Logic
inferred← citeshttps://doi.org/10.3233/fi-1991-14403openalex-snapshot
A Three-Valued Logic for Software Specification and Validation. Tertium tamen datur
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.