Formative Processes with Applications to the Decision Problem in Set Theory-Reference-Cited by-同舟云学术

Formative Processes with Applications to the Decision Problem in Set Theory

Published:2002-01 Issue:2 Volume:172 Page:165-201
ISSN:0890-5401
Container-title:Information and Computation
language:en
Short-container-title:Information and Computation

Author:

Cantone Domenico,Ursino Pietro,Omodeo Eugenio G.

Publisher

Elsevier BV

Subject

Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science

Reference24 articles.

1. Non-resolution theorem proving;Bledsoe;Artificial Intelligence,1977

2. Decision procedures for elementary sublanguages of set theory. X. Multilevel syllogistic extended by the singleton and powerset operators;Cantone;J. Automat. Reasoning,1991

3. Cantone, D., Cutello, V., and Policriti, A.1990, Set-theoretic reductions of Hilbert's tenth problem, inProc. of 3rd Workshop Computer Science Logic, Kaiserslautern, 1989, Lecture Notes in Computer Science, Vol. 440, pp. 65–75, Springer-Verlag, Berlin/New York.

4. Techniques of computable set theory with applications to proof verification;Cantone;Comm. Pure Appl. Math.,1995

5. Computable Set Theory;Cantone,1989

Cited by 10 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Decidability of the Satisfiability Problem for Boolean Set Theory with the Unordered Cartesian Product Operator;ACM Transactions on Computational Logic;2024-01-16

2. Onset and Today’s Perspectives of Multilevel Syllogistic;Lecture Notes in Computer Science;2024

3. Complexity Assessments for Decidable Fragments of Set Theory. I: A Taxonomy for the Boolean Case*;Fundamenta Informaticae;2021-06-30

4. Complexity assessments for decidable fragments of set theory. II: A taxonomy for ‘small’ languages involving membership;Theoretical Computer Science;2020-12

5. Adding the power-set to description logics;Theoretical Computer Science;2020-04