Why Horn formulas matter in computer science: initial structures and generic examples (Q1089797): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/0022-0000(87)90027-4 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2041182895 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3960112 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3220555 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Model theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3947092 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3698262 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Evaluation Based Theorem Prover / rank
 
Normal rank
Property / cites work
 
Property / cites work: A formal notion of program-based test data adequacy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3332238 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unit Refutations and Horn Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5522915 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The decision problem for some classes of sentences without quantifiers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3673087 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the expressive power of data dependencies / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3216138 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic uses of the Feferman-Vaught theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Introduction to model theory and to the metamathematics of algebra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5509669 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arithmetic analogues of McAloon's unique Rosser sentences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomials with Rational Coefficients Which are Hard to Compute / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5815606 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Horn clause computability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3700870 / rank
 
Normal rank

Latest revision as of 19:02, 17 June 2024

scientific article
Language Label Description Also known as
English
Why Horn formulas matter in computer science: initial structures and generic examples
scientific article

    Statements

    Why Horn formulas matter in computer science: initial structures and generic examples (English)
    0 references
    1987
    0 references
    See the review of the preliminary version in Lect. Notes Comput. Sci. 185, 374-387 (1985; Zbl 0563.68013).
    0 references
    abstract data types
    0 references
    Armstrong relations
    0 references
    Horn formulas
    0 references
    0 references

    Identifiers