Number of the records: 1  

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

  1. 1.
    0523434 - ÚI 2023 RIV GB eng J - Journal Article
    Badia, G. - Cintula, Petr - Hájek, Petr - Tedder, Andrew
    How Much Propositional Logic Suffices for Rosser's Undecidability Theorem?
    Review of Symbolic Logic. Roč. 15, č. 2 (2022), s. 487-504. ISSN 1755-0203. E-ISSN 1755-0211
    R&D Projects: GA ČR GA17-04630S
    Institutional support: RVO:67985807
    Keywords : undecidability * substructural logic * Robinson arithmetic
    OECD category: Pure mathematics
    Impact factor: 0.6, year: 2022
    Method of publishing: Limited access
    http://dx.doi.org/10.1017/S175502032000012X
    Permanent Link: http://hdl.handle.net/11104/0307787
     
     
Number of the records: 1  

  This site uses cookies to make them easier to browse. Learn more about how we use cookies.