scientific article; zbMATH DE number 1256672
From MaRDI portal
Publication:4230359
zbMATH Open0914.03009MaRDI QIDQ4230359FDOQ4230359
Authors: Jerzy Marcinkowski, Leszek Pacholski
Publication date: 19 April 1999
Title of this publication is not available (Why is that?)
Recommendations
Decidability of theories and sets of sentences (03B25) Undecidability and degrees of sets of sentences (03D35)
Cited In (19)
- Title not available (Why is that?)
- Implication of clauses is undecidable
- On the complexity of entailment in existential conjunctive first-order logic with atomic negation
- Title not available (Why is that?)
- Satisfiability of the smallest binary program
- On the complexity of single-rule datalog queries.
- Paths, tree homomorphisms and disequalities for \(\mathcal H_1\)-clauses
- Entailment is undecidable for symbolic heap separation logic formulæ with non-established inductive rules
- Processes, Terms and Cycles: Steps on the Road to Infinity
- Title not available (Why is that?)
- Top program construction and reduction for polynomial time meta-interpretive learning
- Title not available (Why is that?)
- Thue trees
- Logical reduction of metarules
- The undecidability of entailment and relevant implication
- Primal grammars and unification modulo a binary clause
- The joy of implications, aka pure Horn formulas: mainly a survey
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4230359)