4 found
Order:
Disambiguations:
Eugenio G. Omodeo [3]Eugenio Giovanni Omodeo [1]
  1.  1
    Andrea Formisano, Eugenio G. Omodeo & Ewa Orłowska (2006). An Environment for Specifying Properties of Dyadic Relations and Reasoning About Them II: Relational Presentation of Non-Classical Logics. In Harrie de Swart, Ewa Orlowska, Gunther Smith & Marc Roubens (eds.), Theory and Applications of Relational Structures as Knowledge Instruments Ii. Springer 89--104.
    Direct download  
     
    Export citation  
     
    My bibliography   1 citation  
  2.  5
    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)  
     
    Export citation  
     
    My bibliography  
  3.  1
    Eugenio Giovanni Omodeo (1980). Three Existence Principles in a Modal Calculus Without Descriptions Contained in A. Bressan's ${\Rm MC}^\Nu$. Notre Dame Journal of Formal Logic 21 (4):711-727.
    Direct download (4 more)  
     
    Export citation  
     
    My bibliography  
  4.  0
    Eugenio G. Omodeo, Franco Parlamento & Alberto Policriti (1996). Decidability of ∀*∀‐Sentences in Membership Theories. Mathematical Logic Quarterly 42 (1):41-58.
    The problem is addressed of establishing the satisfiability of prenex formulas involving a single universal quantifier, in diversified axiomatic set theories. A rather general decision method for solving this problem is illustrated through the treatment of membership theories of increasing strength, ending with a subtheory of Zermelo-Fraenkel which is already complete with respect to the ∀*∀ class of sentences. NP-hardness and NP-completeness results concerning the problems under study are achieved and a technique for restricting the universal quantifier is presented.
    Direct download (3 more)  
     
    Export citation  
     
    My bibliography