Institute of Information Theory and Automation

You are here

Projects

Dept.: MTR Duration: 2018 - 2020
Graded properties are ubiquitous in human discourse and reasoning. They are characterized by the fact that they may apply with different intensity to different objects. Typical examples are vague properties (e.g. “tall” or “rich”), that is, those that do not establish a clear distinction between objects that satisfy them and those that do not, and hence have blurry boundaries and borderline cases...
Dept.: MTR Duration: 2017 - 2019
Classical mathematical logic, built on the conceptually simple core of propositional Boolean calculus, plays a crucial role in modern computer science. A critical limit to its applicability is the underlying bivalent principle that forces all propositions to be either true or false. Propositional logics of graded notions (such as tall, rich, etc.) have been deeply studied for over two decades...
Dept.: MTR Duration: 2017 - 2018
Many-valued logics are a prominent family of non-classical logics whose intended semantics uses more than the two classical truth-values, truth/false. The study of these logics is stimulated by strong mutually beneficial connections with other mathematical disciplines such as universal algebra, topology, and model, proof, game and category theory. The achieved results have led to many interesting...
Dept.: MTR Duration: 2016 - 2019
Substructural logics are formal reasoning systems that refine classical logic by weakening the structural rules in Gentzen sequent calculus. While classical logic generally formalises the notion of truth, substructural logics allow to handle notions such as resources, vagueness, meaning, and language syntax, motivated by studies in computer science, epistemology, economy, and linguistics....
Dept.: MTR Duration: 2015 - 2017
The main aim of the project is to deepen and extend the mathematical foundations for adequate modeling of vague quantifiers as fuzzy quantifiers in the framework of MFL. We will examine previous results on fuzzy quantifiers from this new perspective and extend them in several ways by considering formalisms and results of MFL, including H'ajek's fuzzy probability logic, general two-level...
Dept.: MTR Duration: 2013 - 2016
Formal systems of (non-)classical logics are essential in many areas of computer science. Their appreciation is due to their deductive nature, universality and portability, and the power they gain from their rigorous mathematical background. Such a diverse landscape of logical systems has greatly benefited from a unified approach offered by Abstract Algebraic Logic. The purpose of this project is...