Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/complexity-of-the-problem-of-being-equivalent-to-horn-formulas-ii-bCzjtUOiOc
References (15)
-
SN Vassilyev (1997)
10.1007/BF02673030Sib. Math. J., 38
-
YuL Ershov (1964)
Decidability of the elementary theory of distributive structures with relative complements and of the filter theoryAlgebra Logika, 3
-
F Galvin (1967)
10.1090/S0002-9904-1967-11640-9Bull. Am. Math. Soc., 73
-
ME Buzikov (2019)
10.1016/j.procs.2019.02.004Procedia Comput. Sci., 150
-
SN Vassilyev, GM Ponomarev (2011)
Automation methods for logical derivation and their application in the control of dynamic and intelligent systemsTrudy Inst. Mat. Mekh. UrO RAN, 17
-
SN Vassilyev, EA Cherkashin (1998)
Intellectual telescope guidanceSib. Zh. Ind. Mat., 1
-
A Janiczak (1953)
10.4064/fm-40-1-131-139Fund. Math., 40
-
SN Vassilyev, AA Galyaev (2017)
Logical-optimization approach to pursuit problems for a group of targetsDokl. RAN, 474
-
S Feferman (1959)
10.4064/fm-47-1-57-103Fund. Math., 47
-
A Horn (1951)
10.2307/2268661J. Symb. Log., 16
-
NT Kogabaev (2022)
10.1007/s10469-022-09665-zAlgebra and Logic, 60
-
ZhA Almagambetov (1965)
On classes of axioms closed with respect to the given reduced products and powersAlgebra Logika, 4
-
10.1016/j.na.2005.06.047
-
10.1016/j.na.2005.06.056
-
10.1016/S0362-546X(96)00360-4
- Publisher
- Springer Journals
- Copyright
- Copyright © The Author(s), under exclusive licence to Springer Nature Switzerland AG 2023. Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
- ISSN
- 0002-5232
- eISSN
- 1573-8302
- DOI
- 10.1007/s10469-023-09700-7
- Publisher site
- See Article on Publisher Site
Abstract
We look at the complexity of the existence problem for a Horn sentence equivalent to a given one. It is proved that for a signature consisting of one unary function symbol and any finite number of unary predicate symbols, the problem is computable. For a signature with at least two unary function symbols, it is stated that the problem mentioned is an m-complete ∑10set\documentclass[12pt]{minimal}\usepackage{amsmath}\usepackage{wasysym}\usepackage{amsfonts}\usepackage{amssymb}\usepackage{amsbsy}\usepackage{mathrsfs}\usepackage{upgreek}\setlength{\oddsidemargin}{-69pt}\begin{document}$${\sum }_{1}^{0}\mathrm{set}$$\end{document}.
Journal
Algebra and Logic – Springer Journals
Published: Sep 1, 2022
Keywords: Horn formula; m-reducibility; ∑10set\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$${\sum }_{1}^{0}\mathrm{set}$$\end{document}.