On the public citation graph

Reasoning about partial functions with the aid of a computer

https://doi.org/10.1007/bf01135375
0 signed · 51 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.1006/inco.1993.1063openalex-snapshot
An Axiomatic Theory for Partial Functions
inferredcites →https://doi.org/10.1006/jsco.1995.1012openalex-snapshot
Contexts in Mathematical Reasoning and Computation
inferredcites →https://doi.org/10.1007/3-540-58156-1_26openalex-snapshot
A mechanization of strong Kleene logic for partial functions
inferredcites →https://doi.org/10.1007/3-540-58233-9_6openalex-snapshot
Theory interpretation in simple type theory
inferredcites →https://doi.org/10.1007/978-3-642-68952-9openalex-snapshot
Foundations of Constructive Mathematics
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.1007/bf00881906openalex-snapshot
IMPS: An interactive mathematical proof system
inferredcites →https://doi.org/10.1007/bf02221764openalex-snapshot
The logic of existence
inferredcites →https://doi.org/10.1007/bf02333196openalex-snapshot
Ayer's analysis of negation
inferredcites →https://doi.org/10.1007/bfb0036465openalex-snapshot
Partial functions in comstructive formal theories
inferredcites →https://doi.org/10.1007/bfb0061839openalex-snapshot
Identity and existence in intuitionistic logic
inferredcites →https://doi.org/10.1007/bfb0090733openalex-snapshot
Formalizing constructive mathematics: Why and how?
inferredcites →https://doi.org/10.1016/0168-0072(93)90144-3openalex-snapshot
A simple type theory with partial functions and subtypes11Supported by the MITRE-Sponsored Research program. Presented at the 9th International Congress of Logic, Methodology and Philosophy of Science held in Uppsala, Sweden, August 7-14, 1991.
inferredcites →https://doi.org/10.1016/0304-3975(90)90005-3openalex-snapshot
A first order logic for partial functions
inferredcites →https://doi.org/10.1090/conm/106/1057818openalex-snapshot
Polymorphic typed lambda-calculi in a type-free axiomatic framework
inferredcites →https://doi.org/10.1093/analys/20.6.125openalex-snapshot
Sense Without Denotation
inferredcites →https://doi.org/10.1109/32.241769openalex-snapshot
Predicate logic for software engineering
inferredcites →https://doi.org/10.1201/b13782-17openalex-snapshot
An Introduction to Mathematical Logic
inferredcites →https://doi.org/10.1305/ndjfl/1093634483openalex-snapshot
Partial functions in type theory.
inferredcites →https://doi.org/10.1305/ndjfl/1093957655openalex-snapshot
Existential import revisited.
inferredcites →https://doi.org/10.2307/2021988openalex-snapshot
Existential Presuppositions and Existential Commitments
inferredcites →https://doi.org/10.2307/2182165openalex-snapshot
On the Logic of Existence and Denotation
inferredcites →https://doi.org/10.2307/2182169openalex-snapshot
Nondesignating Singular Terms
inferredcites →https://doi.org/10.2307/2214437openalex-snapshot
Truth and Singular Terms
inferredcites →https://doi.org/10.2307/2266170openalex-snapshot
A formulation of the simple theory of types
inferredcites →https://doi.org/10.2307/2266971openalex-snapshot
Non-standard models for formal logics
inferredcites →https://doi.org/10.2307/2267646openalex-snapshot
A relative consistency proof
inferredcites →https://doi.org/10.2307/2267917openalex-snapshot
A Construction for Models of Consistent Systems.
inferredcites →https://doi.org/10.2307/2271770openalex-snapshot
Existence and Description in Formal Logic.
inferredcites →https://doi.org/10.2307/2273023openalex-snapshot
H. Leblanc and R. H. Thomason. Completeness theorems for some presupposition-free logics. Fundamenta mathematicae, vol. 62 no. 2 (1968), pp. 125–164.
inferredcites →https://doi.org/10.2307/2274487openalex-snapshot
A partial functions version of Church's simple theory of types
inferredcites →https://doi.org/10.2307/2313586openalex-snapshot
Introduction to Mathematical Logic.
inferredcites →https://doi.org/10.25405/ncl.34124868openalex-snapshot
On the Usability of Logics which Handle Partial Functions
inferredcites →https://doi.org/10.4064/fm-37-1-87-110openalex-snapshot
A construction for consistent systems

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9781405164801.ch12openalex-snapshot
Free Logics
inferred← citeshttps://doi.org/10.1007/10722086_22openalex-snapshot
Model Sets in a Nonconstructive Logic of Partial Terms with Definite Descriptions
inferred← citeshttps://doi.org/10.1007/3-540-61511-3_94openalex-snapshot
IMPS: An updated system description
inferred← citeshttps://doi.org/10.1007/978-3-540-25984-8_35openalex-snapshot
Formalizing Undefinedness Arising in Calculus
inferred← citeshttps://doi.org/10.1007/978-3-642-30885-7_8openalex-snapshot
Preventing Arithmetic Overflows in Alloy
inferred← citeshttps://doi.org/10.1007/978-94-017-0458-8_4openalex-snapshot
More Free Logic
inferred← citeshttps://doi.org/10.1016/j.scico.2014.05.009openalex-snapshot
Preventing arithmetic overflows in Alloy
inferred← citeshttps://doi.org/10.1017/s0956796805005666openalex-snapshot
The logic of demand in Haskell
inferred← citeshttps://doi.org/10.1023/a:1006437704595openalex-snapshot
STMM: A Set Theory for Mechanized Mathematics
inferred← citeshttps://doi.org/10.1023/a:1011215918556openalex-snapshot
From Predication to Programming
inferred← citeshttps://doi.org/10.1023/a:1026744827863openalex-snapshot
A Set Theory with Support for Partial Functions
inferred← citeshttps://doi.org/10.1109/fie.2004.1408559openalex-snapshot
Simple type theory: simple steps towards a formal specification
inferred← citeshttps://doi.org/10.14236/ewic/iwfm1999.5openalex-snapshot
A Scheme for Defining Partial Higher-Order Functions by Recursion
inferred← citeshttps://doi.org/10.2178/jsl/1190150149openalex-snapshot
The lazy logic of partial terms
inferred← citeshttps://doi.org/10.31219/osf.io/kjta7openalex-snapshot
Towards a coding-like experience for mathematical proof writing
inferred← citeshttps://doi.org/10.71548/23847openalex-snapshot
Semantics of Funtion Tables on the Reals
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.