12 found
Sort by:
  1. Alberto Policriti & Eugenio Omodeo (2012). The Bernays—Schönfinkel—Ramsey Class for Set Theory: Decidability. Journal of Symbolic Logic 77 (3):896-918.
    As proved recently, the satisfaction problem for all prenex formulae in the set-theoretic Bernays-Shönfinkel-Ramsey class is semi-decidable over von Neumann's cumulative hierarchy. Here that semi-decidability result is strengthened into a decidability result for the same collection of formulae.
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  2. Eugenio Omodeo & Alberto Policriti (2010). The Bernays-Schönfinkel-Ramsey Class for Set Theory: Semidecidability. Journal of Symbolic Logic 75 (2):459-480.
    As is well-known, the Bernays-Schönfinkel-Ramsey class of all prenex ∃*∀* -sentences which are valid in classical first-order logic is decidable. This paper paves the way to an analogous result which the authors deem to hold when the only available predicate symbols are ∈ and =, no constants or function symbols are present, and one moves inside a (rather generic) Set Theory whose axioms yield the well-foundedness of membership and the existence of infinite sets. Here semi-decidability of the satisfiability problem for (...)
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  3. Ewa Orlowska, Alberto Policriti & Andrzej Szalas (2006). Foreword. Journal of Applied Non-Classical Logics 16 (3-4):249-250.
    Direct download (5 more)  
     
    My bibliography  
     
    Export citation  
  4. Andrea Formisano, Eugenio G. Omodeo & Alberto Policriti (2005). The Axiom of Elementary Sets on the Edge of Peircean Expressibility. Journal of Symbolic Logic 70 (3):953 - 968.
    Being able to state the principles which lie deepest in the foundations of mathematics by sentences in three variables is crucially important for a satisfactory equational rendering of set theories along the lines proposed by Alfred Tarski and Steven Givant in their monograph of 1987. The main achievement of this paper is the proof that the 'kernel' set theory whose postulates are extensionality. (E), and single-element adjunction and removal. (W) and (L), cannot be axiomatized by means of three-variable sentences. This (...)
    Direct download (4 more)  
     
    My bibliography  
     
    Export citation  
  5. Agostino Dovier, Carla Piazza & Alberto Policriti (2000). Comparing Expressiveness of Set Constructor Symbols. In. In Dov M. Gabbay & Maarten de Rijke (eds.), Frontiers of Combining Systems. Research Studies Press. 275--289.
    No categories
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  6. Johan Van Benthem, Giovanna D'Agostino, Angelo Montanari & Alberto Policriti (1998). Modal Deduction in Second-Order Logic and Set Theory: II. Studia Logica 60 (3):387 - 420.
    In this paper, we generalize the set-theoretic translation method for polymodal logic introduced in [11] to extended modal logics. Instead of devising an ad-hoc translation for each logic, we develop a general framework within which a number of extended modal logics can be dealt with. We first extend the basic set-theoretic translation method to weak monadic second-order logic through a suitable change in the underlying set theory that connects up in interesting ways with constructibility; then, we show how to tailor (...)
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  7. Johan van Benthem, Giovanna D'Agostino, Angelo Montanari & Alberto Policriti (1998). Modal Deduction in Second-Order Logic and Set Theory - II. Studia Logica 60 (3):387-420.
    In this paper, we generalize the set-theoretic translation method for poly-modal logic introduced in [11] to extended modal logics. Instead of devising an ad-hoc translation for each logic, we develop a general framework within which a number of extended modal logics can be dealt with. We first extend the basic set-theoretic translation method to weak monadic second-order logic through a suitable change in the underlying set theory that connects up in interesting ways with constructibility; then, we show how to tailor (...)
    Direct download (8 more)  
     
    My bibliography  
     
    Export citation  
  8. Angelo Montanari & Alberto Policriti (1997). Review: Peter Ohrstrom, Per F. V. Hasle, Temporal Logic. From Ancient Ideas to Artificial Intelligence. [REVIEW] Journal of Symbolic Logic 62 (3):1044-1046.
    Direct download (2 more)  
     
    My bibliography  
     
    Export citation  
  9. Angelo Montanari & Alberto Policriti (1996). Decidability Results for Metric and Layered Temporal Logics. Notre Dame Journal of Formal Logic 37 (2):260-282.
    We study the decidability problem for metric and layered temporal logics. The logics we consider are suitable to model time granularity in various contexts, and they allow one to build granular temporal models by referring to the "natural scale" in any component of the model and by properly constraining the interactions between differently-grained components. A monadic second-order language combining operators such as temporal contextualization and projection, together with the usual displacement operator of metric temporal logics, is considered, and the theory (...)
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation  
  10. Eugenio G. Omodeo, Franco Parlamento & Alberto Policriti (1996). Decidability of ∀*∀‐Sentences in Membership Theories. Mathematical Logic Quarterly 42 (1):41-58.
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  11. Franco Parlamento & Alberto Policriti (1992). The Decision Problem for Restricted Universal Quantification in Set Theory and the Axiom of Foundation. Mathematical Logic Quarterly 38 (1):143-156.
    No categories
    Direct download (3 more)  
     
    My bibliography  
     
    Export citation  
  12. Franco Parlamento & Alberto Policriti (1991). Expressing Infinity Without Foundation. Journal of Symbolic Logic 56 (4):1230-1235.
    The axiom of infinity can be expressed by stating the existence of sets satisfying a formula which involves restricted universal quantifiers only, even if the axiom of foundation is not assumed.
    Direct download (6 more)  
     
    My bibliography  
     
    Export citation