Author of the publication

A decidable quantified fragment of set theory with ordered pairs and some undecidable extensions

, and . GandALF, volume 96 of EPTCS, page 224-237. (2012)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Banishing Ultrafilters from Our Consciousness., , and . Martin Davis on Computability, Computational Logic, and Mathematical Foundations, volume 10 of Outstanding Contributions to Logic, Springer, (2016)Decision Procedures for Stratified Set-Theoretic Syllogistics., and . ISSAC, page 105-110. ACM, (1993)The satisfiability problem for Boolean set theory with a choice correspondence (Extended version)., , and . CoRR, (2017)An Experiment on the Connection between the DLs' Family DL<ForAllPiZero> and the Real World, and . CoRR, (2012)Games, automata, logics and formal verification (GandALF 2016)., and . Inf. Comput., (2018)A Tableau-Based Decision Procedure for a Fragment of Set Theory with Iterated Membership., , and . J. Autom. Reason., 34 (1): 49-72 (2005)Towards ontological interoperability of cognitive IoT agents based on natural language processing., , , , and . Intelligenza Artificiale, 16 (1): 93-112 (2022)Complexity assessments for decidable fragments of Set Theory. III: Testers for crucial, polynomial-maximal decidable Boolean languages., , and . Theor. Comput. Sci., (2023)On the Decidability of Formulae Involving Continuous and Closed Functions., and . IJCAI, page 425-430. Morgan Kaufmann, (1989)A Fast Saturation Strategy for Set-Theoretic Tableaux.. TABLEAUX, volume 1227 of Lecture Notes in Computer Science, page 122-137. Springer, (1997)