Alberto Zanardo

According to our database1, Alberto Zanardo authored at least 28 papers between 1983 and 2023.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Structural theory of trees II. Completeness and completions of trees.
Contributions Discret. Math., 2023

Structural theory of trees I. Branching and condensations of trees.
Contributions Discret. Math., 2023

2019
First-Order Definability of Transition Structures.
J. Log. Lang. Inf., 2019

2013
Indistinguishability, Choices, and Logics of Agency.
Stud Logica, 2013

2010
Completeness of a Branching-Time Logic with Possible Choices.
Stud Logica, 2010

2007
From Linear to Branching-Time Temporal Logics: Transfer of Semantics and Definability.
Log. J. IGPL, 2007

2006
Moment/History Duality in Prior's Logics of Branching-Time.
Synth., 2006

Quantification over Sets of Possible Worlds in Branching-Time Semantics.
Stud Logica, 2006

2003
Topological Aspects of Branching-Time Semantics.
Stud Logica, 2003

2002
Fibring Modal First-Order Logics: Completeness Preservation.
Log. J. IGPL, 2002

2001
Fibring: Completeness Preservation.
J. Symb. Log., 2001

1999
Non-Definability of the Class of Complete Bundled Trees.
Log. J. IGPL, 1999

1998
A Gabbay-Rule Free Axiomatization of T×W Validity.
J. Philos. Log., 1998

Undivided and Indistinguishable Histories in Branching-Time Logics.
J. Log. Lang. Inf., 1998

1996
Branching-Time Logic with Quantification over Brances: The Point of View of Modal Logic.
J. Symb. Log., 1996

Plausible Reasoning: A First-Order Approach.
J. Appl. Non Class. Logics, 1996

1994
Synchronized Histories in Prior-Thomason Representation of Branching Time.
Proceedings of the Temporal Logic, First International Conference, 1994

1993
Ockhamist Computational Logic: Past-Sensitive Necessitation in CTL.
J. Log. Comput., 1993

Making an Autonomous Robot Plan Temporally Constrained Maintenance Operations.
Proceedings of the Advances in Artificial Intelligence, 1993

1992
A Note about the Axioms for Branching-Time Logic.
Notre Dame J. Formal Log., 1992

1991
A complete deductive-system for since-until branching-time logic.
J. Philos. Log., 1991

Typicality for Plausible Reasoning.
Proceedings of the Trends in Artificial Intelligence, 1991

1990
Axiomatization of 'Peircean' branching-time logic.
Stud Logica, 1990

1989
A non-compactness phenomenon in logics with hyperintensional predication.
J. Philos. Log., 1989

1986
On the characterizability of the frames for the "unpreventability of the present and the past".
Notre Dame J. Formal Log., 1986

1985
A finite axiomatization of the set of strongly valid Ockhamist formulas.
J. Philos. Log., 1985

1984
Individual concepts as propositional variables in ML<sup>ν+1</sup>.
Notre Dame J. Formal Log., 1984

1983
On the equivalence between the calculi MC<sup>ν</sup> and EC<sup>ν+1</sup> of A. Bressan.
Notre Dame J. Formal Log., 1983


  Loading...