Complexity in mechanized hypothesis formation
type: Item
instance of: scholarly article
title: Complexity in mechanized hypothesis formation
zbMATH Open document ID: 0404.68097
DOI: 10.1016/0304-3975(79)90045-8
author: Pavel Pudlák
author: Frederick Neil Springsteel
published in: Theoretical Computer Science
publication date: 1979-01-01T00:00:00Z
Mathematics Subject Classification ID: 68T99
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 62A01
Mathematics Subject Classification ID: 62P99
Mathematics Subject Classification ID: 03D15
Mathematics Subject Classification ID: 03B10
Mathematics Subject Classification ID: 03B50
Mathematics Subject Classification ID: 03C99
zbMATH DE Number: 3628433
zbMATH Keywords: Artifical Intelligence
zbMATH Keywords: Mechanized Hypotheses Formation
zbMATH Keywords: Non-Classical Logic
zbMATH Keywords: Many-Valued Logic
zbMATH Keywords: Computational Complexity
zbMATH Keywords: Predicate Calculus
zbMATH Keywords: Generalized Quantifiers
zbMATH Keywords: Quantifiers with Statistical Interpretation
zbMATH Keywords: Np- Complete
zbMATH Keywords: Guha
MaRDI profile type: Publication
full work available at URL: 0304-3975(79)90045-8
OpenAlex ID: W2058392968
cites work: Q4091421
cites work: The complexity of theorem-proving procedures
cites work: Q4041119
cites work: Q4124353
cites work: Q5640746
cites work: The GUHA method of automatic hypotheses determination
cites work: Mechanizing hypothesis formation. Mathematical foundations for a general theory
cites work: Q4088105
cites work: Statistical quantifiers in observational calculi: An application in GUHA- methods
cites work: Q4142699
cites work: On the Structure of Polynomial Time Reducibility
cites work: A comparison of polynomial time reducibilities
cites work: Q4080749
description: scientific article; zbMATH DE number 3628433