Arrow logic and infinite counting (Q1582310): Difference between revisions
From MaRDI portal
Created a new Item |
Set OpenAlex properties. |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1023/a:1005215730377 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1592072016 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 09:52, 30 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Arrow logic and infinite counting |
scientific article |
Statements
Arrow logic and infinite counting (English)
0 references
18 June 2001
0 references
Arrow logic is a propositional modal logic with three modal operators, dyadic, monadic, and constant, which correspond, respectively, to composition, inverse, and identity of arrows. It is a broadly applicable modal formalism covering various areas from dynamic semantics of natural language to transition systems in computer science. The weakly associative arrow logic, one of the fundamental ones among them, has been proved to be finitely axiomatizable by Maddux and decidable by Nemeti. It is also known by Andreka, Hodkinson and Nemeti that weakly associative relational algebras, which constitute the algebraic counterparts of the logic, have the finite base property. In this paper, the author introduces to the logic various kinds of additional modalities modeling infinite counting features of natural language such as ``much more'', ``of good quantity'', and ``many times'', and proves that the logics thus enriched are also finitely axiomatizable and decidable. The finite axiomatizability results are consequences of (in fact, equivalent to) the finite base property of weakly associative relational algebras. Nevertheless, interestingly enough, it is also shown that their algebras do not enjoy the property.
0 references
arrow logic
0 references
weakly associative relation algebra
0 references
graded modality
0 references
finite axiomatizability
0 references
decidability
0 references
finite base property
0 references