Complexity of sets obtained as values of propositional formulas
type: Item
instance of: scholarly article
title: Complexity of sets obtained as values of propositional formulas
zbMATH Open document ID: 1114.03004
DOI: 10.1023/B:MATN.0000015028.10892.68
published in: Mathematical Notes
publication date: 2007-03-09T00:00:00Z
Mathematics Subject Classification ID: 03B05
Mathematics Subject Classification ID: 68Q30
zbMATH DE Number: 5132506
zbMATH Keywords: Kolmogorov complexity
zbMATH Keywords: logical connectives
zbMATH Keywords: law of weak excluded middle
zbMATH Keywords: deducibility
zbMATH Keywords: intuitionistic logic
zbMATH Keywords: propositional calculus
author: Alexey Chernov
MaRDI profile type: Publication
full work available at URL: b:matn.0000015028.10892.68
OpenAlex ID: W2054594741
description: scientific article; zbMATH DE number 5132506