相关论文: A Taxonomy of C-systems
Type-free systems of logic are designed to consistently handle significant instances of self-reference. Some consistent type-free systems also have the feature of allowing the sort of general abstraction or comprehension principle that…
The construction of first-order logic and set theory gives rise to apparent circularities of mutual dependence, making it unclear which can act as a self-contained starting point in the foundation of mathematics. In this paper, we carry out…
Much work has been done on extending the well-founded semantics to general disjunctive logic programs and various approaches have been proposed. However, these semantics are different from each other and no consensus is reached about which…
We obtain, for the first time, a modular many-valued semantics for combined logics, which is built directly from many-valued semantics for the logics being combined, by means of suitable universal operations over partial non-deterministic…
We initiate the study of pseudofiniteness in continuous logic. We introduce a related concept, namely that of pseudocompactness, and investigate the relationship between the two concepts. We establish some basic properties of…
A set of general physical principles is proposed as the structural basis for the theory of complex systems. First the concept of harmony is analyzed and its different aspects are uncovered. Then the concept of reflection is defined and…
We present a unifying framework for type systems for process calculi. The core of the system provides an accurate correspondence between essentially functional processes and linear logic proofs; fragments of this system correspond to…
Guidelines and consistency rules of UML are used to control the degrees of freedom provided by the language to prevent faults. Guidelines are used in specific domains (e.g., avionics) to recommend the proper use of technologies. Consistency…
In [1], systems of weakening of intuitionistic negation logic called Z_n and CZ_n were developed in the spirit of da Costa's approach(c.f. [2]) by preserving, differently from da Costa, its fundamental properties: antitonicity, inversion…
Programming with logic for sophisticated applications must deal with recursion and negation, which together have created significant challenges in logic, leading to many different, conflicting semantics of rules. This paper describes a…
In this paper, we further develop the framework of Modular Systems that lays model-theoretic foundations for combining different declarative languages, agents and solvers. We introduce a multi-language logic of modular systems. We define…
In this article we determine several theorems and methods for solving linear congruences and systems of linear congruences, and we find the number of distinct solutions. Many examples of solving congruences are given.
We investigate the structure common to causal theories that attempt to explain a (part of) the world. Causality implies conservation of identity, itself a far from simple notion. It imposes strong demands on the universalizing power of the…
Concurrent systems identify systems, either software, hardware or even biological systems, that are characterized by sets of independent actions that can be executed in any order or simultaneously. Computer scientists resort to a causal…
Digraphs provide an alternative syntax for propositional logic, with digraph kernels corresponding to classical models. Semikernels generalize kernels and we identify a subset of well-behaved semikernels that provides nontrivial models for…
The use of meta-rules in logic, i.e., rules whose content includes other rules, has recently gained attention in the setting of non-monotonic reasoning: a first logical formalisation and efficient algorithms to compute the (meta)-extensions…
This paper shows that, even at the most basic level, the parallel, countable branching and uncountable branching recurrences of Computability Logic (see http://www.cis.upenn.edu/~giorgi/cl.html) validate different principles.
This is a reflection on the author's experience in teaching logic at the graduate level in a computer science department. The main lesson is that model building and the process of modelling must be placed at the centre stage of logic…
Regular synchronization languages can be used to define rational relations of finite words, and to characterize subclasses of rational relations, like automatic or recognizable relations. We provide a systematic study of the decidability of…
The importance of transformations and normal forms in logic programming, and generally in computer science, is well documented. This paper investigates transformations and normal forms in the context of Defeasible Logic, a simple but…