Definability with bounded number of bound variables (Q922523): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Preservation of expressive completeness in temporal models / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Moschovakis closure ordinals / rank
 
Normal rank
Property / cites work
 
Property / cites work: An application of games to the completeness problem for formalized theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational complexity of logical theories / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3674621 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3768883 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5549024 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper and lower bounds for first order expressibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Boolean algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Definability in dynamic logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deux ou trois choses que je sais de <i>L</i><sub>n</sub> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3949052 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Unbounded program memory adds to the expressive power of first-order programming logic / rank
 
Normal rank

Latest revision as of 10:42, 21 June 2024

scientific article
Language Label Description Also known as
English
Definability with bounded number of bound variables
scientific article

    Statements

    Definability with bounded number of bound variables (English)
    0 references
    0 references
    0 references
    1989
    0 references
    A model-theoretic method for establishing the k-variable property is given in the paper. To study the k-variable property is important from the temporal logic point of view. A first-order theory satisfies the k- variable property if every formula is, under the theory, equivalent to a formula with at most k bound variables. The method used in the paper to establish the k-variable property is based on a variant of the Ehrenfeucht-Fraissé game. Results in the literature for linear orders are unified and simplified by the method. Some new k-variable properties for various theories of bounded-degree trees are established. These results imply the existence of a finite basis for the first-order expressible temporal connectives over tree models of bounded degree.
    0 references
    k-variable property
    0 references
    temporal logic
    0 references
    Ehrenfeucht-Fraissé game
    0 references
    bounded- degree trees
    0 references
    tree models
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references