Stefano Baratella

According to our database, Stefano Baratella authored at least 28 papers between 1988 and 2023.

Collaborative distances:

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

2023

An infinitary propositional probability logic.

Stefano Baratella

Arch. Math. Log., May, 2023

A finitary outer measure logic.

Stefano Baratella

J. Log. Comput., April, 2023

2020

A two-dimensional metric temporal logic.

Stefano Baratella, Andrea Masini

Math. Log. Q., 2020

2019

A completeness theorem for continuous predicate modal logic.

Stefano Baratella

Arch. Math. Log., 2019

2018

Continuous propositional modal logic.

Stefano Baratella

J. Appl. Non Class. Logics, 2018

2017

A predicate extension of real valued logic.

Stefano Baratella

Arch. Math. Log., 2017

2015

The Real truth.

Stefano Baratella, Domenico Zambella

Math. Log. Q., 2015

A note on infinitary continuous logic.

Stefano Baratella

Math. Log. Q., 2015

2013

A natural deduction system for bundled branching time logic.

Stefano Baratella, Andrea Masini

J. Appl. Non Class. Logics, 2013

2010

Quantum coherent spaces and linear logic.

Stefano Baratella

RAIRO Theor. Informatics Appl., 2010

2006

A note on unbounded metric temporal logic over dense time domains.

Stefano Baratella, Andrea Masini

Math. Log. Q., 2006

2004

An infinitary variant of Metric Temporal Logic over dense time domains.

Stefano Baratella, Andrea Masini

Math. Log. Q., 2004

A Way of Making World Quantification Explicit.

Stefano Baratella, Andrea Masini

Log. J. IGPL, 2004

An approach to infinitary temporal proof theory.

Stefano Baratella, Andrea Masini

Arch. Math. Log., 2004

2003

Consequences of neocompact quantifier elimination.

Stefano Baratella, Siu-Ah Ng

Math. Log. Q., 2003

A proof-theoretic investigation of a logic of positions.

Stefano Baratella, Andrea Masini

Ann. Pure Appl. Log., 2003

2001

Neocompact quantifier elimination in structures based on Banach spaces.

Stefano Baratella, Siu-Ah Ng

Ann. Pure Appl. Log., 2001

1998

Approximating Classical Theorems.

Stefano Baratella, Stefano Berardi

J. Log. Comput., 1998

The theory of [(<i>Z</i>)\vec]<i>C</i>(2)²{\vec Z}C(2)^2-lattices is decidable.

Stefano Baratella, Carlo Toffalori

Arch. Math. Log., 1998

1997

A parallel game semantics for Linear Logic.

Stefano Baratella, Stefano Berardi

Arch. Math. Log., 1997

1995

Non Standard Regular Finite Set Theory.

Ruggero Ferro, Stefano Baratella

Math. Log. Q., 1995

1994

A Modal Approach to Negation as Failure Rule.

Stefano Baratella

J. Log. Comput., 1994

1993

A Class of Programs for which SLDNF Resolution and NAF Rule are Complete.

Stefano Baratella

Theor. Comput. Sci., 1993

A Theory of Sets with the Negation of the Axiom of Inflnity.

Ruggero Ferro, Stefano Baratella

Math. Log. Q., 1993

1992

A Completeness Result for Allowed Semi-Strict Programs with Respect to Well-Behaved and Allowed Query Clauses.

Stefano Baratella

Theor. Comput. Sci., 1992

1991

Models of Clark's completion for some classes of logic programs.

Stefano Baratella

Fundam. Informaticae, 1991

1989

On Some Properties of Recursively Enumerable Equivalence Relations.

Stefano Baratella

Math. Log. Q., 1989

1988

A completeness result for SLDNF resoultion.

Stefano Baratella, Gilberto Filé

Bull. EATCS, 1988