Add to ORKGIn this paper we give a decidable tableau calculus for the unquantified theory MLSSF, which involves in addition the constructs of Multilevel Syllogistic, namely 'membership', 'equality', 'set inclusion', 'binary union', 'binary intersection' and 'set difference', also finite numerations '., ..., .' and the predicate Finite.The notions of U-hierarchy and U-realization of a graph w.r.t. given U-sets, as well as some of their properties, are discussed and used to show the soundness and the completeness of the tableau calculus presented
Graphs are ubiquitous in Computer Science. For this reason, in many areas, it is very important to h...
AbstractThe use of sets in declarative programming has been advocated by several authors in the lite...
AbstractTo implement finite structures in a symbolic computation program such as Mathematica, we con...
In this paper we give a decidable tableau calculus for the unquantified theory MLSSF, which involves...
Abstract. Set theory is the common language of mathematics. Therefore, set theory plays an important...
for the predicate calculus as to obtain a direct proof (without using compactness) of the fact that ...
We consider the problem of deciding the satisfiability of quantifier-freeformulas in the theory of f...
We propose a tableau-like decision procedure for deciding the finite satisfiability of unquantified ...
We develop a novel formal theory of finite structures, based on a view of finite structures as a fun...
This paper surveys various decidability results in the set theory. In the first part, we focus on ce...
In most theorem proving applications, a proper treatment of equational theories or equality is manda...
We introduce a tableau calculus for Haíek’s Basic Logic BL. This calculus has many of the desirable ...
A way of introducing simple (finite) set designations and operations as firstclass objects of an (un...
We propose a tableau-like decision procedure for deciding the satisfiability of set-theoretical for...
The proof of properties of formal systems including inequalities is currently evolving into an incre...
Graphs are ubiquitous in Computer Science. For this reason, in many areas, it is very important to h...
AbstractThe use of sets in declarative programming has been advocated by several authors in the lite...
AbstractTo implement finite structures in a symbolic computation program such as Mathematica, we con...
In this paper we give a decidable tableau calculus for the unquantified theory MLSSF, which involves...
Abstract. Set theory is the common language of mathematics. Therefore, set theory plays an important...
for the predicate calculus as to obtain a direct proof (without using compactness) of the fact that ...
We consider the problem of deciding the satisfiability of quantifier-freeformulas in the theory of f...
We propose a tableau-like decision procedure for deciding the finite satisfiability of unquantified ...
We develop a novel formal theory of finite structures, based on a view of finite structures as a fun...
This paper surveys various decidability results in the set theory. In the first part, we focus on ce...
In most theorem proving applications, a proper treatment of equational theories or equality is manda...
We introduce a tableau calculus for Haíek’s Basic Logic BL. This calculus has many of the desirable ...
A way of introducing simple (finite) set designations and operations as firstclass objects of an (un...
We propose a tableau-like decision procedure for deciding the satisfiability of set-theoretical for...
The proof of properties of formal systems including inequalities is currently evolving into an incre...
Graphs are ubiquitous in Computer Science. For this reason, in many areas, it is very important to h...
AbstractThe use of sets in declarative programming has been advocated by several authors in the lite...
AbstractTo implement finite structures in a symbolic computation program such as Mathematica, we con...