Fabio Bellissima

According to our database, Fabio Bellissima authored at least 16 papers between 1984 and 1999.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of five.

1999

Minimal p-morphic Images, Axiomatizations and Coverings in the Modal Logic K4.

Fabio Bellissima, Saverio Cittadini

Stud Logica, 1999

Finite Trees in Tense Logic.

Fabio Bellissima, Saverio Cittadini

Stud Logica, 1999

1998

Duality and Completeness for US-Logics.

Fabio Bellissima, Saverio Cittadini

Notre Dame J. Formal Log., 1998

1997

Minimal Axiomatization in Modal Logic.

Fabio Bellissima, Saverio Cittadini

Math. Log. Q., 1997

1995

A Distinguishable Model Theorem for the Minimal US-Tense Logic.

Fabio Bellissima, Anna Bucalo

Notre Dame J. Formal Log., 1995

1992

On the Inadequacy of the Relational Semantic for the "Until" Operator.

Fabio Bellissima, Alessandra Ciupi

Math. Log. Q., 1992

1990

Post Complete and 0-Axiomatizable Modal Logics.

Fabio Bellissima

Ann. Pure Appl. Log., 1990

1989

Infinite Sets of Nonequivalent Modalities.

Fabio Bellissima

Notre Dame J. Formal Log., 1989

A General Treatment of Equivalent Modalities.

Fabio Bellissima, Massimo Mirolli

J. Symb. Log., 1989

Two classes of intermediate propositional logics without disjunction property.

Fabio Bellissima

Arch. Math. Log., 1989

1988

Finite and Finitely Separable Intermediate Propositional Logics.

Fabio Bellissima

J. Symb. Log., 1988

On the lattice of extensions of the modal logics KAlt_n.

Fabio Bellissima

Arch. Math. Log., 1988

1986

Finitely Generated Free Heyting Algebras.

Fabio Bellissima

J. Symb. Log., 1986

1985

A Test to Determine Distinct Modalities in the Extensions of <i>S4</i>.

Fabio Bellissima

Math. Log. Q., 1985

1984

On the relationship between one-point frames and degrees of unsatisfiability of modal formulas.

Fabio Bellissima

Notre Dame J. Formal Log., 1984

Atoms in Modal Algebras.

Fabio Bellissima

Math. Log. Q., 1984