Modal languages and bounded fragments of predicate logic (Q1267082): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1023/a:1004275029985 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1991981864 / rank | |||
Normal rank |
Latest revision as of 11:00, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Modal languages and bounded fragments of predicate logic |
scientific article |
Statements
Modal languages and bounded fragments of predicate logic (English)
0 references
18 November 1998
0 references
The aim of the paper is to find natural fragments of first-order logic which have the ``nice'' properties of basic modal logic: decidability, the finite model property, interpolation, etc. First, the authors show that the finite-variable fragments are not suitable in this sense. Then they define the guarded fragment, in which only bounded quantification of the form \(\exists\overline y(R\overline x\overline y \& \phi(\overline x,\overline y))\) is allowed, and prove that it enjoys the nice properties mentioned above.
0 references
fragments of first-order logic
0 references
modal logic
0 references
decidability
0 references
finite model property
0 references
interpolation
0 references
guarded fragment
0 references
bounded quantification
0 references
0 references