Weak Essentially Undecidable Theories of Concatenation

dc.date.accessioned	2022-04-07T19:19:13Z
dc.date.available	2022-04-07T19:19:13Z
dc.date.created	2020-09-15T19:30:18Z
dc.date.issued	2022
dc.identifier.citation	Murwanashyaka, Juvenal . Weak Essentially Undecidable Theories of Concatenation. Archive for Mathematical Logic. 2022
dc.identifier.uri	http://hdl.handle.net/10852/93432
dc.description.abstract	In the language {0,1,∘,⪯}, where 0 and 1 are constant symbols, ∘ is a binary function symbol and ⪯ is a binary relation symbol, we formulate two theories, WD and D, that are mutually interpretable with the theory of arithmetic R and Robinson arithmetic Q, respectively. The intended model of WD and D is the free semigroup generated by {00,11} under string concatenation extended with the prefix relation. The theories WD and D are purely universally axiomatised, in contrast to Q which has the Π2-axiom ∀x[ x=0∨∃y[ x=Sy ] ].
dc.language	EN
dc.rights	Attribution 4.0 International
dc.rights.uri	https://creativecommons.org/licenses/by/4.0/
dc.title	Weak Essentially Undecidable Theories of Concatenation
dc.type	Journal article
dc.creator.author	Murwanashyaka, Juvenal
cristin.unitcode	185,15,13,65
cristin.unitname	Flere komplekse variable, logikk og operatoralgebraer
cristin.ispublished	true
cristin.fulltext	original
cristin.qualitycode	1
dc.identifier.cristin	1830228
dc.identifier.bibliographiccitation	info:ofi/fmt:kev:mtx:ctx&ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.jtitle=Archive for Mathematical Logic&rft.volume=&rft.spage=&rft.date=2022
dc.identifier.jtitle	Archive for Mathematical Logic
dc.identifier.doi	https://doi.org/10.1007/s00153-022-00820-y
dc.identifier.urn	URN:NBN:no-96003
dc.type.document	Tidsskriftartikkel
dc.type.peerreviewed	Peer reviewed
dc.source.issn	0933-5846
dc.identifier.fulltext	Fulltext https://www.duo.uio.no/bitstream/handle/10852/93432/1/da964c9b-2b89-4728-89da-58b92a7acc94.pdf
dc.type.version	PublishedVersion