Complexity of the Problem of ∀-Representation for Sentences › Research Explorer

Novosibirsk State University's Research Portal

Complexity of the Problem of ∀-Representation for Sentences

Research output: Contribution to journal › Article › peer-review

Stream Data Analytics and Machine Learning laboratory

DOI

https://doi.org/10.1007/s10469-024-09751-4
Final published version

Нурлан Талгатович Когабаев

Original language	English
Pages (from-to)	372-375
Number of pages	4
Journal	Algebra and Logic
Volume	62
Issue number	4
DOIs	https://doi.org/10.1007/s10469-024-09751-4
Publication status	Published - Sept 2023

Research areas

PA-degree, autostability relative to strong constructivizations, computable categoricity, computable model, decidable categoricity, decidable categoricity spectrum, decidable model, degree of decidable categoricity

OECD FOS+WOS

1.02.QL LOGIC
1.01.PQ MATHEMATICS

ID: 60410762