Computable Scott sentences and the weak Whitehead problem for finitely presented groups

Annals of Pure and Applied Logic 175 (7):103441 (2024)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 92,197

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Similar books and articles

Scott sentences for certain groups.Julia F. Knight & Vikram Saraph - 2018 - Archive for Mathematical Logic 57 (3-4):453-472.
Scott sentences for equivalence structures.Sara B. Quinn - 2020 - Archive for Mathematical Logic 59 (3-4):453-460.
Π10 classes and orderable groups.Reed Solomon - 2002 - Annals of Pure and Applied Logic 115 (1-3):279-302.
Finite Axiomatizability and Scientific Discovery.Daniel N. Osherson & Scott Weinstein - 1988 - PSA: Proceedings of the Biennial Meeting of the Philosophy of Science Association 1988:409 - 412.
Embeddings of Computable Structures.Asher M. Kach, Oscar Levin & Reed Solomon - 2010 - Notre Dame Journal of Formal Logic 51 (1):55-68.
On decidability of amenability in computable groups.Karol Duda & Aleksander Ivanov - 2022 - Archive for Mathematical Logic 61 (7):891-902.

Analytics

Added to PP
2024-04-07

Downloads
11 (#1,141,291)

6 months
11 (#242,683)

Historical graph of downloads
How can I increase my downloads?

Author's Profile

Gianluca Paolini
University of Amsterdam

Citations of this work

No citations found.

Add more citations

References found in this work

Scott sentences for certain groups.Julia F. Knight & Vikram Saraph - 2018 - Archive for Mathematical Logic 57 (3-4):453-472.

Add more references