This article is cited in 2 papers

Table admissible inference rules

V. V. Rimatskii

Chair of High Mathematics, Institute of Architecture and Construction, Siberian Federal University, Krasnoyarsk, RUSSIA

Abstract: A recursive basis of inference rules is described which are instantaneously admissible in all table (residually finite) logics extending one of the logics $\mathrm{Int}$ and $Grz$. A rather simple semantic criterion is derived to determine whether a given inference rule is admissible in all table superintuitionistic logics, and the relationship is established between admissibility of a rule in all table (residually finite) superintuitionistic logics and its truth values in $\mathrm{Int}$.

Keywords: inference rules, table logic, superintuitionistic logic.

UDC: 510.643

Received: 10.05.2007

 English version: Algebra and Logic, 2009, 48:3, 228–236

Bibliographic databases:

• 
• 
• 
• 
• 
•