Journal of Symbolic Logic 41 (1):45-49 (1976)
|Abstract||A new reduction class is presented for the satisfiability problem for well-formed formulas of the first-order predicate calculus. The members of this class are closed prenex formulas of the form ∀ x∀ yC. The matrix C is in conjunctive normal form and has no disjuncts with more than three literals, in fact all but one conjunct is unary. Furthermore C contains but one predicate symbol, that being unary, and one function symbol which symbol is binary|
|Keywords||No keywords specified (fix it)|
|Categories||categorize this paper)|
|Through your library||Configure|
Similar books and articles
Scott Soames (2006). Is H2O a Liquid, or Water a Gas? Philosophy and Phenomenological Research 72 (3):635-639.
M. R. Krom (1970). The Decision Problem for Formulas in Prenex Conjunctive Normal Form with Binary Disjunctions. Journal of Symbolic Logic 35 (2):210-216.
G. Gutiérrez, I. P. de Guzmán, J. Martínez, M. Ojeda-Aciego & A. Valverde (2002). Satisfiability Testing for Boolean Formulas Using Δ-Trees. Studia Logica 72 (1):85 - 112.
Robin Hirsch, Ian Hodkinson & Roger D. Maddux (2002). Provability with Finitely Many Variables. Bulletin of Symbolic Logic 8 (3):348-379.
Petr Hájek (2002). Monadic Fuzzy Predicate Logics. Studia Logica 71 (2):165-175.
Giorgie Dzhaparidze (1991). Predicate Provability Logic with Non-Modalized Quantifiers. Studia Logica 50 (1):149 - 160.
Giorgie Dzhaparidze (1990). Decidable and Enumerable Predicate Logics of Provability. Studia Logica 49 (1):7 - 21.
Mitsunori Kobayashi & Arata Ishimoto (1982). A Propositional Fragment of Leśniewski's Ontology and its Formulation by the Tableau Method. Studia Logica 41 (2-3):181 - 195.
Stål O. Aanderaa, Egon Börger & Harry R. Lewis (1982). Conservative Reduction Classes of Krom Formulas. Journal of Symbolic Logic 47 (1):110-130.
Sorry, there are not enough data points to plot this chart.
Added to index2009-01-28
Total downloads1 ( #291,771 of 722,869 )
Recent downloads (6 months)0
How can I increase my downloads?