Semantics for the minimal well-determined logic

Abstract

The minimal well-determined logic in the language with conjunction and implication is investigated. A calculus for this logic, in which the modus ponens rule is not postulated, is proposed. The main result consists in constructing a semantics for this logic: it is formed by the class of lower semilattices with a greatest element, where the implication is interpreted using a partial function defined via the partial order of the semilattice. This extension of the notion of interpreting logical connectives in a matrix allows for the correct determination of the truth of formulas in the language with conjunction and implication. Soundness and completeness theorems are proved. The proposed semantics creates an opportunity to investigate questions of finite model property for such systems and can also serve as a basis for studying other properties of both the minimal well-determined logic itself and its extensions. As an application of the obtained results, we prove that the set of tautologies of the minimal well-determined logic is decidable in polynomial time and present a corresponding decision algorithm.

Disclosure

“ow to construct such embeddings explicitly (and whether it is possible) remains unclear to the authors. Thus, the inquiry concerning W fits naturally into this broader picture. Acknowledgements During the preparation of this work, the language model DeepSeek (DeepSeek-R1) was used to check the correctness of proofs, to formalize the decision procedure for the set W, and to check English. Funding The research leading to these results has received funding from the Basic Research Pro”

PDF page 19

Classification

Proof ideas or individual proof-step assistance

Multiplier

8

Verified

2026-08-23T18:56:40.944454Z

Structural counts