Logics for complexity classes
type: Item
instance of: scholarly article
title: Logics for complexity classes
zbMATH Open document ID: 1407.68192
author: Vladimir Naidenko
publication date: 2019-01-08T00:00:00Z
full work available at URL: https://arxiv.org/abs/1312.4652
Mathematics Subject Classification ID: 68Q15
zbMATH DE Number: 6997891
zbMATH Keywords: theory of computation
zbMATH Keywords: computational complexity
zbMATH Keywords: Turing reduction
zbMATH Keywords: completeness
zbMATH Keywords: descriptive complexity
MaRDI profile type: Publication
OpenAlex ID: W3103066066
arXiv ID: 1312.4652
DOI: 10.1093/JIGPAL/JZU027
published in: Logic Journal of the IGPL
Recommended article: Q3827989
Recommended article: Logical and schematic characterization of complexity classes
Recommended article: Q3000099
Recommended article: Logics which capture complexity classes over the reals
Recommended article: Proof Complexity of Non-classical Logics
Recommended article: Logics for Computer Science
Recommended article: Logics capturing relativized complexity classes uniformly
Recommended article: Q4723713
description: scientific article; zbMATH DE number 6997891