1991
DOI: 10.1007/bf01880328
|View full text |Cite
|
Sign up to set email alerts
|

Computations in fragments of intuitionistic propositional logic

Abstract: This article ~s a report on research m progress into the structure of fimte diagrams of mtuinomst~c proposmonal logic with the aid of automated reasoning systems for larger calculanons. A/ragment of a proposmonal logic is the set of formulae built up from a fimte number of proposinonal variables by means of a number of connectives of the logic, among which possibly non-standard ones like ~ or ~ which are stud~ed here. The dtagram of that fragment ~s the set of eqmvalence classes of its formulae parnally ordere… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
8
0

Year Published

2010
2010
2024
2024

Publication Types

Select...
3
3
1

Relationship

1
6

Authors

Journals

citations
Cited by 11 publications
(8 citation statements)
references
References 5 publications
0
8
0
Order By: Relevance
“…As the IPC fragment with two variables, implication and negation has exactly 518 equivalence classes of formulas [15,16], one would expect the construction deriving "*" from "#" to reach a fixpoint. We can use our prover to find out when that happens.…”
Section: Discussionmentioning
confidence: 99%
“…As the IPC fragment with two variables, implication and negation has exactly 518 equivalence classes of formulas [15,16], one would expect the construction deriving "*" from "#" to reach a fixpoint. We can use our prover to find out when that happens.…”
Section: Discussionmentioning
confidence: 99%
“…Note that the cardinality of the free equivalential algebras with zero has been already computed in these three cases in . In the figures below, each dot denotes a labelled element of the frame, and a solid circle or ellipse shows an equivalence class in the frame.…”
Section: Free Algebras In E0mentioning
confidence: 99%
“…The fragments of intuitionistic logic with double negation were also studied, e.g., in [2,10,14] as well as in [5], where ¬¬ was treated as a modal operator. Our construction works for some of these fragments, e.g., for (→, ¬¬) and (∧, →, ¬¬), where as the equivalent algebraic semantics one can take Hilbert algebras with regularization (HI r ) and Brouwerian semilattices with regularization (B r ), respectively, i.e., Hilbert algebras or Brouwerian semilattices endowed with a retraction r into the set of regular elements that is simultaneously a closure operator with respect to the natural order.…”
Section: Algebraic Semantics For Ipc →¬¬ and Ipc ∧→¬¬mentioning
confidence: 99%