On the public citation graph

Partial logics reconsidered: A conservative approach

https://doi.org/10.1007/bf01211555
0 signed · 38 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.1007/3-540-50214-9_19openalex-snapshot
A three-valued logic for software specification and validation
inferredcites →https://doi.org/10.1007/3-540-50214-9_20openalex-snapshot
Three-valued predicates for software specification and validation
inferredcites →https://doi.org/10.1007/978-94-009-5203-4_1openalex-snapshot
Partial Logic
inferredcites →https://doi.org/10.1007/bf00264250openalex-snapshot
A logic covering undefinedness in program proofs
inferredcites →https://doi.org/10.1007/bf00292109openalex-snapshot
Partial-predicate logic in computer science
inferredcites →https://doi.org/10.1016/0304-3975(90)90005-3openalex-snapshot
A first order logic for partial functions
inferredcites →https://doi.org/10.1016/0304-3975(91)90334-xopenalex-snapshot
Weak logic theory
inferredcites →https://doi.org/10.25405/ncl.34124868openalex-snapshot
On the Usability of Logics which Handle Partial Functions

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-44525-0_18openalex-snapshot
Retrenchment, Refinement, and Simulation
inferred← citeshttps://doi.org/10.1007/3-540-44525-0_24openalex-snapshot
A Computation Model for Z Based on Concurrent Constraint Resolution
inferred← citeshttps://doi.org/10.1007/3-540-45648-1_3openalex-snapshot
Controlling Control Systems: An Application of Evolving Retrenchment
inferred← citeshttps://doi.org/10.1007/978-1-4471-0851-1_24openalex-snapshot
Retrenchment and Punctured Simulation
inferred← citeshttps://doi.org/10.1007/978-3-540-39993-3_9openalex-snapshot
Object-Oriented Specification and Open Distributed Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-87603-8_5openalex-snapshot
Model Based Refinement and the Tools of Tomorrow
inferred← citeshttps://doi.org/10.1007/978-3-642-12592-8_9openalex-snapshot
Refining Exceptions in Four-Valued Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-24559-6_42openalex-snapshot
Term Rewriting in Logics of 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-35737-4_6openalex-snapshot
Satisfiability and Validity Problems in Many-Sorted Composition-Nominative Pure Predicate Logics
inferred← citeshttps://doi.org/10.1007/978-3-642-40787-1_3openalex-snapshot
Monitoring of Temporal First-Order Properties with Aggregations
inferred← citeshttps://doi.org/10.1007/bfb0014447openalex-snapshot
What is an Abstract Data Type, after all?
inferred← citeshttps://doi.org/10.1007/bfb0019999openalex-snapshot
Formal Development with ABEL
inferred← citeshttps://doi.org/10.1007/bfb0053354openalex-snapshot
Well defined B
inferred← citeshttps://doi.org/10.1007/s001650050056openalex-snapshot
Sharp Retrenchment, Modulated Refinement and Simulation
inferred← citeshttps://doi.org/10.1007/s10703-015-0222-7openalex-snapshot
Monitoring of temporal first-order properties with aggregations
inferred← citeshttps://doi.org/10.1016/0304-3975(93)90077-7openalex-snapshot
A simple sequent calculus for partial functions
inferred← citeshttps://doi.org/10.1016/j.jal.2011.03.001openalex-snapshot
Inversive meadows and divisive meadows
inferred← citeshttps://doi.org/10.1016/j.scico.2007.04.002openalex-snapshot
Engineering and theoretical underpinnings of retrenchment
inferred← citeshttps://doi.org/10.1017/s0956796805005666openalex-snapshot
The logic of demand in Haskell
inferred← citeshttps://doi.org/10.1093/comjnl/42.2.73openalex-snapshot
Adapting Calculational Logic to the Undefined
inferred← citeshttps://doi.org/10.1109/ase.1999.802189openalex-snapshot
Retrenchment: extending the reach of refinement
inferred← citeshttps://doi.org/10.1109/icfem.2000.873813openalex-snapshot
Maximally abstract retrenchments
inferred← citeshttps://doi.org/10.1109/ismvl.2001.924572openalex-snapshot
Automated reasoning with ordinary assertions and default assumptions
inferred← citeshttps://doi.org/10.14236/ewic/iwfm2000.6openalex-snapshot
Retrenchment: Extending Refinement for Continuous and Control Systems
inferred← citeshttps://doi.org/10.14279/depositonce-102openalex-snapshot
A set-based calculus and its implementation
inferred← citeshttps://doi.org/10.2478/s13537-012-0027-3openalex-snapshot
Satisfiability in composition-nominative logics
inferred← citeshttps://doi.org/10.3929/ethz-a-006750722openalex-snapshot
Term rewriting in logics of partial functions
inferred← citeshttps://doi.org/10.55056/ceur-ws.org/vol-848/icteri-2012-ceur-ws-paper-38-p-56-70.pdfopenalex-snapshot
Satisfiability Problem in Composition-Nominative Logics of Quantifier-Equational Level
inferred← citeshttps://doi.org/10.5555/640070.640072openalex-snapshot
Subtyping and constructive specification
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.