Number of the records: 1

How Much Propositional Logic Suffices for Rosser's Undecidability Theorem?

SYSNO	0523434
Title	How Much Propositional Logic Suffices for Rosser's Undecidability Theorem?
Author(s)	Badia, G. (AT) Cintula, Petr (UIVT-O)_{RID, ORCID, SAI} Hájek, Petr (UIVT-O)_{RID, SAI} Tedder, Andrew (UIVT-O)_{RID, ORCID, SAI}
Source Title	Review of Symbolic Logic. Roč. 15, č. 2 (2022), s. 487-504. - : Cambridge University Press
Document Type	Článek v odborném periodiku
Grant	GA17-04630S GA ČR - Czech Science Foundation (CSF)
Institutional support	UIVT-O - RVO:67985807
Language	eng
Country	GB
Keywords	undecidability * substructural logic * Robinson arithmetic
URL	http://dx.doi.org/10.1017/S175502032000012X
Permanent Link	http://hdl.handle.net/11104/0307787

Number of the records: 1