Search results for "Computer Science::Logic in Computer Science"
showing 2 items of 72 documents
Modal Consequence Relations Extending S4.3: An Application of Projective Unification
2016
We characterize all finitary consequence relations over $\mathbf{S4.3}$ , both syntactically, by exhibiting so-called (admissible) passive rules that extend the given logic, and semantically, by providing suitable strongly adequate classes of algebras. This is achieved by applying an earlier result stating that a modal logic $L$ extending $\mathbf{S4}$ has projective unification if and only if $L$ contains $\mathbf{S4.3}$ . In particular, we show that these consequence relations enjoy the strong finite model property, and are finitely based. In this way, we extend the known results by Bull and Fine, from logics, to consequence relations. We also show that the lattice of consequence relation…
Introduction to Mathematical Logic, Edition 2021
2021
Textbook for students in mathematical logic. First order languages. Axioms of constructive and classical logic. Proving formulas in propositional and predicate logic. Glivenko's theorem and constructive embedding. Axiom independence. Interpretations, models and completeness theorems. Normal forms. Tableaux and resolution methods. Herbrand's theorem. Sections 1, 2, 3 represent an extended translation of the corresponding chapters of the book: V. Detlovs, Elements of Mathematical Logic, Riga, University of Latvia, 1964, 252 pp. (in Latvian).