A first order logic for partial functions (Q5096142): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: A logic covering undefinedness in program proofs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The foundations of mathematics. A study in the philosophy of science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial abstract types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Equational specification of partial higher-order algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partial-predicate logic in computer science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic specifications: a constructive specification method for abstract data types / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5537599 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5560258 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3969890 / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bfb0028972 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4206820621 / rank
 
Normal rank

Latest revision as of 10:42, 30 July 2024

scientific article; zbMATH DE number 7571915
Language Label Description Also known as
English
A first order logic for partial functions
scientific article; zbMATH DE number 7571915

    Statements

    A first order logic for partial functions (English)
    0 references
    0 references
    0 references
    16 August 2022
    0 references
    0 references
    partial function
    0 references
    sequent calculus
    0 references
    universal formula
    0 references
    abstract data types
    0 references
    0 references