UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

2022 EUROPEAN SUMMER MEETING OF THE ASSOCIATION FOR SYMBOLIC LOGIC LOGIC COLLOQUIUM 2022 Reykjavík University Reykjavík, Iceland June 27 – July 1, 2022

The bulletin of symbolic logic, 2022-12, Vol.28 (4), p.566-606

Sorbi, Andrea

2022

Volltextzugriff (PDF)

Jumps of computably enumerable equivalence relations

Annals of pure and applied logic, 2018-03, Vol.169 (3), p.243-259

2018

Volltextzugriff (PDF)

Conjunctive degrees and cylinders

Journal of logic and computation, 2023-10

2023

Volltextzugriff (PDF)

The theory of ceers computes true arithmetic

Annals of pure and applied logic, 2020-08, Vol.171 (8), p.102811, Article 102811

2020

Volltextzugriff (PDF)

A Survey on Universal Computably Enumerable Equivalence Relations

Computability and Complexity, p.418-451

Volltextzugriff (PDF)

INITIAL SEGMENTS OF THE DEGREES OF CEERS

The Journal of symbolic logic, 2022-09, Vol.87 (3), p.1260-1282

2022

Volltextzugriff (PDF)

Comparing the degrees of enumerability and the closed Medvedev degrees

Archive for mathematical logic, 2019-08, Vol.58 (5-6), p.527-542

2019

Volltextzugriff (PDF)

Notes on conjunctive and Quasi degrees

Journal of logic and computation, 2021-07, Vol.31 (5), p.1317-1329

2021

Volltextzugriff (PDF)

Effective Inseparability and Its Applications

Connecting with Computability, 2021, Vol.12813, p.417-423

2021

Volltextzugriff (PDF)

THE COMPLEXITY OF INDEX SETS OF CLASSES OF COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS

The Journal of symbolic logic, 2016-12, Vol.81 (4), p.1375-1395

2016

Volltextzugriff (PDF)

New Computational Paradigms: Changing Conceptions of What Is Computable

1. Aufl., 2008

Volltextzugriff (PDF)

Minimal degrees and downwards density in some strong positive reducibilities and quasi-reducibilities

Journal of logic and computation, 2023-07, Vol.33 (5), p.1060-1088

2023

Volltextzugriff (PDF)

Intermediate logics and factors of the Medvedev lattice

Annals of pure and applied logic, 2008-09, Vol.155 (2), p.69-85

2008

Volltextzugriff (PDF)

Weakly precomplete computably enumerable equivalence relations

Mathematical logic quarterly, 2016-02, Vol.62 (1-2), p.111-127

2016

Volltextzugriff (PDF)

Self-full ceers and the uniform join operator

Journal of logic and computation, 2020-04, Vol.30 (3), p.765-783

2020

Volltextzugriff (PDF)

EFFECTIVE INSEPARABILITY, LATTICES, AND PREORDERING RELATIONS

The review of symbolic logic, 2021-12, Vol.14 (4), p.838-865

2021

Volltextzugriff (PDF)

Taking the Pirahã seriously

Communications in nonlinear science & numerical simulation, 2015-04, Vol.21 (1-3), p.52-69

2015

Volltextzugriff (PDF)

A note on uniform density in weak arithmetical theories

Archive for mathematical logic, 2021-02, Vol.60 (1-2), p.211-225

2021

Volltextzugriff (PDF)

Calibrating word problems of groups via the complexity of equivalence relations

Mathematical structures in computer science, 2018-03, Vol.28 (3), p.457-471

2018

Volltextzugriff (PDF)

INITIAL SEGMENTS OF THE ENUMERATION DEGREES

The Journal of symbolic logic, 2016-03, Vol.81 (1), p.316-325

2016

Volltextzugriff (PDF)

INITIAL SEGMENTS OF THE ${\rm{\Sigma }}_2^0 $ ENUMERATION DEGREES

The Journal of symbolic logic, 2016-03, Vol.81 (1), p.316-325

2016

Volltextzugriff (PDF)

INITIAL SEGMENTS OF THE$\Sigma _2^0$ENUMERATION DEGREES

The Journal of symbolic logic, 2016-03, Vol.81 (1), p.316-325

2016

Volltextzugriff (PDF)

Topological aspects of the Medvedev lattice

Archive for mathematical logic, 2011-05, Vol.50 (3-4), p.319-340

2011

Volltextzugriff (PDF)

Classifying word problems of finitely generated algebras via computable reducibility

International journal of algebra and computation, 2023-06, Vol.33 (4), p.751-768

2023

Volltextzugriff (PDF)

Computation and Logic in the Real World: Third Conference on Computability in Europe, CIE 2007 Siena, Italy, June 18-23, 2007 : Proceedings

2007 edition., 2007

Volltextzugriff (PDF)

1 – 25 von 514

Menü

Weitere Dienste

Einstellungen

2022 EUROPEAN SUMMER MEETING OF THE ASSOCIATION FOR SYMBOLIC LOGIC LOGIC COLLOQUIUM 2022 Reykjavík University Reykjavík, Iceland June 27 – July 1, 2022

Jumps of computably enumerable equivalence relations

Conjunctive degrees and cylinders

The theory of ceers computes true arithmetic

A Survey on Universal Computably Enumerable Equivalence Relations

INITIAL SEGMENTS OF THE DEGREES OF CEERS

Comparing the degrees of enumerability and the closed Medvedev degrees

Notes on conjunctive and Quasi degrees

Effective Inseparability and Its Applications

THE COMPLEXITY OF INDEX SETS OF CLASSES OF COMPUTABLY ENUMERABLE EQUIVALENCE RELATIONS

New Computational Paradigms: Changing Conceptions of What Is Computable

Minimal degrees and downwards density in some strong positive reducibilities and quasi-reducibilities

Intermediate logics and factors of the Medvedev lattice

Weakly precomplete computably enumerable equivalence relations

Self-full ceers and the uniform join operator

EFFECTIVE INSEPARABILITY, LATTICES, AND PREORDERING RELATIONS

Taking the Pirahã seriously

A note on uniform density in weak arithmetical theories

Calibrating word problems of groups via the complexity of equivalence relations

INITIAL SEGMENTS OF THE ENUMERATION DEGREES

INITIAL SEGMENTS OF THE ${\rm{\Sigma }}_2^0 $ ENUMERATION DEGREES

INITIAL SEGMENTS OF THE$\Sigma _2^0$ENUMERATION DEGREES

Topological aspects of the Medvedev lattice

Classifying word problems of finitely generated algebras via computable reducibility

Computation and Logic in the Real World: Third Conference on Computability in Europe, CIE 2007 Siena, Italy, June 18-23, 2007 : Proceedings

Suchergebnisse filtern