Equations in free topoboolean algebra (Q1092029): Difference between revisions
From MaRDI portal
Changed an Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(One intermediate revision by one other user not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4146913 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4750010 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3950540 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Admissible rules for logics containing S4.3 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A criterion for admissibility of rules in the modal system S4 and intuitionistic logic / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3206929 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3964525 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Equations in Free Groups / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: One hundred and two problems in mathematical logic / rank | |||
Normal rank |
Latest revision as of 10:52, 18 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Equations in free topoboolean algebra |
scientific article |
Statements
Equations in free topoboolean algebra (English)
0 references
1986
0 references
Let \(\Lambda\) be a modal or superintuitionistic logic and \(F_{\omega}(\Lambda)\) the free algebra of rank \(\omega\) in the variety of algebras corresponding to \(\Lambda\). For each of the logics S4 and Int the author obtains the following main results. Let \(\Sigma_ f\) be the signature of \(F_{\omega}(\Lambda)\) enriched by the free generators as constant operations. Then: 1) The universal theory of \(F_{\omega}(\Lambda)\) is decidable and there exists an algorithm constructing an obstacle (i.e., roughly speaking, a counter-example) for those universal formulas of \(\Sigma_ f\) that are false in \(F_{\omega}(\Lambda)\). 2) There exists an algorithm verifying the solvability of equations in \(F_{\omega}(\Lambda)\) and finding the solutions of solvable equations.
0 references
modal logic
0 references
superintuitionistic logic
0 references
free algebra
0 references
S4
0 references
Int
0 references