Sfoglia per Autore
Completeness and Decidability of the Deducibility Problem for Some Classes of Formulas of Set Theory
1987-01-01 Policriti, Alberto
Secision Procedures for Elementary Sublanguages of Set Theory XI. Unsolvability of the Decision Problem for a Restricted Subclass of the Delta_0-Formulas in Set Theory
1988-01-01 Parlamento, Franco; Policriti, Alberto
Decidability results for classes of purely universal formulae and quantifiers elimination in Set Theory
1988-01-01 Cantone, D; Cutello, V; Policriti, Alberto
The Logically Simplest Form of the Infinity Axiom
1988-01-01 Parlamento, Franco; Policriti, Alberto
Decision Procedures for Elementary Sublanguages of Set Theory. IX. Unsolvability of the decision problem for a restricted subclass of delta-0 formulas of set theory.
1988-01-01 Parlamento, F; Policriti, Alberto
A contribution to the Automated Treatment of Membership Theories
1990-01-01 Omodeo, E; Parlamento, Franco; Policriti, Alberto
Truth Table for a Combinatorial Kernel of Set Theories
1990-01-01 Omodeo, E; Parlamento, Franco; Policriti, Alberto
The Automation of Syllogistic II. Optimization and Complexity Issues
1990-01-01 Cantone, D; Omodeo, E; Policriti, Alberto
Note on: The Logically Simplest Form of the Infinity Axiom
1990-01-01 Parlamento, Franco; Policriti, Alberto
Decision Procedures for Elementary Sublanguages of Set Theory XIII. Model Graphs, Reflection and Decidability.
1991-01-01 Parlamento, Franco; Policriti, Alberto
Expressing Infinity without Foundation
1991-01-01 Parlamento, Franco; Policriti, Alberto
A derived algorithm for evaluating epsilon-expressions over abstract sets
1993-01-01 Omodeo, E; Parlamento, Franco; Policriti, Alberto
Undecidability Results for Restricted Universally Quantified Formulae of Set Theory
1993-01-01 Parlamento, Franco; Policriti, Alberto
A set-theoretic translation method for polymodal logics
1995-01-01 D'Agostino, Giovanna; Montanari, Angelo; Policriti, Alberto
A set-theoretic translation method for (poly)modal logics
1995-01-01 D'Agostino, Giovanna; Montanari, Angelo; Policriti, Alberto
T-theorem proving. I
1995-01-01 Policriti, Alberto; Schwartz, J. T.
Set-theoretic decidability results for modal theorem proving
1996-01-01 D'Agostino, Giovanna; Montanari, Angelo; Policriti, Alberto
Integrating lists, multisets, and sets in a logic programming framework.
1996-01-01 Dovier, Agostino; Policriti, Alberto; G., Rossi
Decidability results for metric and layered temporal logics
1996-01-01 Montanari, Angelo; Policriti, Alberto
Complementation in the lattice of equivalence relations
1996-01-01 Dikranjan, Dikran; Policriti, Alberto
Legenda icone
- file ad accesso aperto
- file disponibili sulla rete interna
- file disponibili agli utenti autorizzati
- file disponibili solo agli amministratori
- file sotto embargo
- nessun file disponibile