Characteristic inference rules (Q2342800): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s11787-015-0116-x / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2034340658 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On residual finiteness and finite embeddability / rank
 
Normal rank
Property / cites work
 
Property / cites work: AN ALGEBRAIC APPROACH TO CANONICAL FORMULAS: INTUITIONISTIC CASE / rank
 
Normal rank
Property / cites work
 
Property / cites work: The decidability of certain intermediate propositional logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraizable logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2752417 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The finite embeddability property for residuated lattices, pocrims and BCK-algebras. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Canonical rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138859 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3934450 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Admissibility via natural dualities / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128959 / rank
 
Normal rank
Property / cites work
 
Property / cites work: ON ADMISSIBLE RULES OF INTUITIONISTIC PROPOSITIONAL LOGIC / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Word Problem for Abstract Algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Connections between Residual Finiteness, Finite Embeddability and the Word Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Residuated lattices. An algebraic glimpse at substructural logics / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5459443 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Brouwerian Semilattices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5682023 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The algebra of topology / rank
 
Normal rank
Property / cites work
 
Property / cites work: On closed elements in closure algebras / rank
 
Normal rank
Property / cites work
 
Property / cites work: EQUATIONAL COMPLEXITY OF THE FINITE ALGEBRA MEMBERSHIP PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Admissibility of logical inference rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4376076 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rules and Derived Rules / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4159022 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Syntax and semantics of superintuitionistic logics / rank
 
Normal rank

Latest revision as of 01:21, 10 July 2024

scientific article
Language Label Description Also known as
English
Characteristic inference rules
scientific article

    Statements

    Characteristic inference rules (English)
    0 references
    0 references
    29 April 2015
    0 references
    The author generalizes his notion of the quasi-characteristic rule for Heyting algebras (HA) introduced in [\textit{A. I. Tsitkin}, Mat. Sb., Nov. Ser. 102(144), 314--323 (1977; Zbl 0355.02016); translation in Math. USSR, Sb. 31, 279--288 (1977; Zbl 0386.03011)]. It is a counterpart of the Jankov-style characteristic formula: each subdirectly irreducible HA \(A\) is assigned a certain rule \(\rho(A) \) such that \(\rho(A)\) is refutable in a HA \(B\) iff \(A\) is embeddable in \(B\). Since already quasivarieties are not determined by their subdirectly irreducible algebras, dealing with the quasivariety or more general semantics requires using a wider subclass of rule-determining algebras. In this paper, the author uses partial algebras to construct such rules (generally, multi-conclusion ones), now called characteristic. It is shown that every universal class of algebras is axiomatized by a suitable set of characteristic rules, and a criterion is given for a subset of rules to be complete in the sense that any universal class is axiomatizable by the rules belonging to this subset. There are a few results on a variant of the finite embedding property (FEP) what the author calls uniform FEP. Connections between the characteristic rules and the canonical rules recently introduced by \textit{E. Jeřábek} [J. Symb. Log. 74, No. 4, 1171--1205 (2009; Zbl 1186.03045)] are also discussed.
    0 references
    0 references
    0 references
    0 references
    0 references
    characteristic rule
    0 references
    equivalential logic
    0 references
    multiple-conclusion rule
    0 references
    partial algebra
    0 references
    universal class
    0 references
    0 references