On decision procedures for sentential logics

Studia Logica 50 (2):173 - 179 (1991)

Abstract

In Section 2 I give a criterion of decidability that can be applied to logics (i.e. Tarski consequence operators) without the finite model property. In Section 3 I study ukasiewicz-style refutation procedures as a method of obtaining decidability results.This method also proves to be more general than Harrop's criterion.

Download options

PhilArchive



    Upload a copy of this work     Papers currently archived: 72,766

External links

Setup an account with your affiliations in order to access resources via your University's proxy server

Through your library

Analytics

Added to PP
2009-01-28

Downloads
31 (#373,271)

6 months
1 (#386,989)

Historical graph of downloads
How can I increase my downloads?

Citations of this work

Refutation Systems in Modal Logic.Valentin Goranko - 1994 - Studia Logica 53 (2):299 - 324.
Hereditarily Structurally Complete Positive Logics.Alex Citkin - 2020 - Review of Symbolic Logic 13 (3):483-502.
Syntactic Refutations Against Finite Models in Modal Logic.Tomasz Skura - 1994 - Notre Dame Journal of Formal Logic 35 (4):595-605.

Add more citations