27 research outputs found
The Logic of Partitions: Introduction to the Dual of the Logic of Subsets
Partitions on a set are dual to subsets of a set in the sense of the category-theoretic duality of epimorphisms and monomorphisms--which is reflected in the duality between quotient objects and subobjects throughout algebra. Modern categorical logic as well as the Kripke models of intuitionistic logic suggest that the interpretation of ordinary "propositional" logic might be the logic of subsets of a given universe set. If "propositional" logic is thus seen as the logic of subsets of a universe set, then the question naturally arises of a dual logic of partitions on a universe set. This paper is an introduction to that logic of partitions dual to classical subset logic. The paper goes from basic concepts up through the correctness and completeness theorems for a tableau system of partition logic
The Logic of Partitions: Introduction to the Dual of the Logic of Subsets
Modern categorical logic as well as the Kripke and topological models of
intuitionistic logic suggest that the interpretation of ordinary
"propositional" logic should in general be the logic of subsets of a given
universe set. Partitions on a set are dual to subsets of a set in the sense of
the category-theoretic duality of epimorphisms and monomorphisms--which is
reflected in the duality between quotient objects and subobjects throughout
algebra. If "propositional" logic is thus seen as the logic of subsets of a
universe set, then the question naturally arises of a dual logic of partitions
on a universe set. This paper is an introduction to that logic of partitions
dual to classical subset logic. The paper goes from basic concepts up through
the correctness and completeness theorems for a tableau system of partition
logic
MaxSAT Evaluation 2018 : Solver and Benchmark Descriptions
Non peer reviewe
Hyperidentities and Related Concepts, I
This survey article illustrates many important current trends and
perspectives for the field including classification of
hyperidentities, characterizations of algebras with
hyperidentities, functional representations of free algebras,
structure results for bigroups, categorical questions and
applications. However, the paper contains new results, too
Achieving while maintaining:A logic of knowing how with intermediate constraints
In this paper, we propose a ternary knowing how operator to express that the
agent knows how to achieve given while maintaining
in-between. It generalizes the logic of goal-directed knowing how proposed by
Yanjing Wang 2015 'A logic of knowing how'. We give a sound and complete
axiomatization of this logic.Comment: appear in Proceedings of ICLA 201
Proceedings of the 21st Conference on Formal Methods in Computer-Aided Design – FMCAD 2021
The Conference on Formal Methods in Computer-Aided Design (FMCAD) is an annual conference on the theory and applications of formal methods in hardware and system verification. FMCAD provides a leading forum to researchers in academia and industry for presenting and discussing groundbreaking methods, technologies, theoretical results, and tools for reasoning formally about computing systems. FMCAD covers formal aspects of computer-aided system design including verification, specification, synthesis, and testing