A computational glimpse at the Leibniz and Frege hierarchies

Annals of Pure and Applied Logic 169 (1):1-20 (2018)
  Copy   BIBTEX

Abstract

This article has no associated abstract. (fix it)

Categories

Keywords

Reprint years

DOI

10.1016/j.apal.2017.07.003

Links

PhilArchive



    Upload a copy of this work     Papers currently archived: 93,098

External links

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

Through your library

My notes

Similar books and articles

Definability hierarchies of general quantifiers.Lauri Hella - 1989 - Annals of Pure and Applied Logic 43 (3):235.
Fine hierarchies via Priestley duality.Victor Selivanov - 2012 - Annals of Pure and Applied Logic 163 (8):1075-1107.
Second-order propositional modal logic and monadic alternation hierarchies.Antti Kuusisto - 2015 - Annals of Pure and Applied Logic 166 (1):1-28.
Fundamental sequences and fast-growing hierarchies for the Bachmann-Howard ordinal.David Fernández-Duque & Andreas Weiermann - 2024 - Annals of Pure and Applied Logic 175 (8):103455.
Implication and analysis in classical frege structures.Robert C. Flagg & John Myhill - 1987 - Annals of Pure and Applied Logic 34 (1):33-85.
On the complexity of the Leibniz hierarchy.Tommaso Moraschini - 2019 - Annals of Pure and Applied Logic 170 (7):805-824.
The computational complexity of module socles.Huishan Wu - 2022 - Annals of Pure and Applied Logic 173 (5):103089.
K-continuous lattices and comprehension principles for Frege structures.Robert C. Flagg - 1987 - Annals of Pure and Applied Logic 36:1-16.
Splitting into degrees with low computational strength.Rod Downey & Keng Meng Ng - 2018 - Annals of Pure and Applied Logic 169 (8):803-834.
On the computational complexity of the theory of Abelian groups.Libo Lo - 1988 - Annals of Pure and Applied Logic 37 (3):205-248.

Analytics

Added to PP
2017-07-28

Downloads
25 (#654,431)

6 months
9 (#355,272)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

A study of truth predicates in matrix semantics.Tommaso Moraschini - 2018 - Review of Symbolic Logic 11 (4):780-804.
On the complexity of the Leibniz hierarchy.Tommaso Moraschini - 2019 - Annals of Pure and Applied Logic 170 (7):805-824.
On Equational Completeness Theorems.Tommaso Moraschini - 2022 - Journal of Symbolic Logic 87 (4):1522-1575.

Add more citations

References found in this work

Modal Logic.Yde Venema, Alexander Chagrov & Michael Zakharyaschev - 2000 - Philosophical Review 109 (2):286.
Protoalgebraic logics.W. J. Blok & Don Pigozzi - 1986 - Studia Logica 45 (4):337 - 369.
Protoalgebraic Logics.Janusz Czelakowski - 2003 - Studia Logica 74 (1):313-342.
A Formalization of Set Theory Without Variables.István Németi - 1990 - Journal of Symbolic Logic 55 (1):350-352.

View all 11 references / Add more references