A weak theory of building blocks
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F67985840%3A_____%2F24%3A00588510" target="_blank" >RIV/67985840:_____/24:00588510 - isvavai.cz</a>
Result on the web
<a href="https://doi.org/10.1002/malq.202300015" target="_blank" >https://doi.org/10.1002/malq.202300015</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1002/malq.202300015" target="_blank" >10.1002/malq.202300015</a>
Alternative languages
Result language
angličtina
Original language name
A weak theory of building blocks
Original language description
We apply the mereological concept of parthood to the coding of finite sequences. We propose a first-order theory in which coding finite sequences is intuitive and transparent. We compare this theory with Robinson arithmetic, adjunctive set theory and weak theories of finite strings and finite trees using interpretability.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10101 - Pure mathematics
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2024
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
Mathematical Logic Quarterly
ISSN
0942-5616
e-ISSN
1521-3870
Volume of the periodical
70
Issue of the periodical within the volume
2
Country of publishing house
US - UNITED STATES
Number of pages
22
Pages from-to
233-254
UT code for WoS article
001231739400001
EID of the result in the Scopus database
2-s2.0-85194488433