Premium
The Downward Transfer of Elementary Satisfiability of Partition Logics
Author(s) -
Shen Enshao,
Chen Yijia
Publication year - 2000
Publication title -
mathematical logic quarterly
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.473
H-Index - 28
eISSN - 1521-3870
pISSN - 0942-5616
DOI - 10.1002/1521-3870(200010)46:4<477::aid-malq477>3.0.co;2-r
Subject(s) - mathematics , reachability , partition (number theory) , satisfiability , transfer (computing) , discrete mathematics , boolean satisfiability problem , graph , combinatorics , computer science , parallel computing
We introduce a notion of pseudo‐reachability in Gaifman graphs and suggest a graph‐theoretic and uniform approach to the Löwenheim‐Skolem‐Tarski Theorems for partition logics as well as logics with general Malitz quantifiers.