Fabio Bellissima

16 papers Journal 16
YearRankTypeTitle / Venue / Authors
1999 J jnl
Finite Trees in Tense Logic.
Stud Logica
Fabio Bellissima, Saverio Cittadini
1999 J jnl
Minimal p-morphic Images, Axiomatizations and Coverings in the Modal Logic K4.
Stud Logica
Fabio Bellissima, Saverio Cittadini
1998 J jnl
Duality and Completeness for US-Logics.
Notre Dame J. Formal Log.
Fabio Bellissima, Saverio Cittadini
1997 J jnl
Minimal Axiomatization in Modal Logic.
Math. Log. Q.
Fabio Bellissima, Saverio Cittadini
1995 J jnl
A Distinguishable Model Theorem for the Minimal US-Tense Logic.
Notre Dame J. Formal Log.
Fabio Bellissima, Anna Bucalo
1992 J jnl
On the Inadequacy of the Relational Semantic for the "Until" Operator.
Math. Log. Q.
Fabio Bellissima, Alessandra Ciupi
1990 J jnl
Post Complete and 0-Axiomatizable Modal Logics.
Ann. Pure Appl. Log.
Fabio Bellissima
1989 J jnl
A General Treatment of Equivalent Modalities.
J. Symb. Log.
Fabio Bellissima, Massimo Mirolli
1989 J jnl
Infinite Sets of Nonequivalent Modalities.
Notre Dame J. Formal Log.
Fabio Bellissima
1989 J jnl
Two classes of intermediate propositional logics without disjunction property.
Arch. Math. Log.
Fabio Bellissima
1988 J jnl
Finite and Finitely Separable Intermediate Propositional Logics.
J. Symb. Log.
Fabio Bellissima
1988 J jnl
On the lattice of extensions of the modal logics KAlt
Arch. Math. Log.
Fabio Bellissima
1986 J jnl
Finitely Generated Free Heyting Algebras.
J. Symb. Log.
Fabio Bellissima
1985 J jnl
A Test to Determine Distinct Modalities in the Extensions of
Math. Log. Q.
Fabio Bellissima
1984 J jnl
Atoms in Modal Algebras.
Math. Log. Q.
Fabio Bellissima
1984 J jnl
On the relationship between one-point frames and degrees of unsatisfiability of modal formulas.
Notre Dame J. Formal Log.
Fabio Bellissima