Introductory courses in symbolic logic focus on the description of formal models of reasoning, and on their application to the analysis and evaluation of arguments. However, we are more interested in studying certain (general/mathematical) properties of the formal systems themselves, not in applying these models to analyze and evaluate arguments. (Our topic is sometimes called metalogic, or the...

Logic is a celebrated representation language because of its formal generality. But there are two senses in which a logic may be considered general, one that concerns a technical ability to discriminate between different types of individuals, and another that concerns constitutive norms for reasoning as such. This essay embraces the former, permutation-invariance conception of logic and rejects...

It is shown how Conceptual Graphs and Formal Concept Analysis may be combined to obtain a formalization of Elementary Logic which is useful for knowledge representation and processing. For this, a translation of conceptual graphs to formal contexts and concept lattices is described through an example. Using a suitable mathematization of conceptual graphs, basics of a uniied mathematical theory ...

We define a weak second-order extension of first-order logic. We prove a second-order cut elimination theorem for this logic and use this to prove a conservativity and a realisability result. We give applications to formal program development and theorem proving, in particular, in modeling techniques in formal metatheory.

The research described in this paper aims at facilitating the process of drawing conclusions while working with incomplete information. The approach is based on formal concept analysis and six valued logic. The Armstrong axioms are further applied to obtain knowledge in cases with incomplete information. Key–Words: Formal concept analysis, incomplete information, logic

First-order logic (FOL) is a formal deductive system used in mathematics, philosophy, linguistics, and computer science. It goes by many names, including: first-order predicate calculus (FOPC), the lower predicate calculus, the language of first-order logic or predicate logic. Unlike natural languages such as English, FOL uses a wholly unambiguous formal language interpreted by mathematical str...

This paper gives a Concurrent Transaction Logic (CT R)based formal model for Weakly-structured Scientific Workflows (WsSWFs) and further implements it in an open source rule language Prova. Compared with the related efforts, the formal model in this paper focuses on conversation-based reactive workflow logic representation and event-driven computation of complex event patterns.

In several disciplines there is a divide between advocates of formal, “classical” or symbolic approaches to representation, which can be expressed using standard formal logic, and advocates of biologically inspired, fuzzy or category-based approaches to representation, which can be implemented using fuzzy logic, neural networks, evolutionary computing and similar techniques. This paper argues t...

Measures on clans of fuzzy sets are traditionally studied as certain functionals on collections of [0, 1]-valued functions. The goal of this paper is to make first steps towards establishing this part of fuzzy mathematics as a formal theory over a suitable predicate fuzzy logic. Two concepts of formal measure theory are sketched within Henkin-style ω-order fuzzy logic.

This paper provides an overview of common challenges in teaching of logic and formal methods to Computer Science and IT students. We discuss our experiences from the course IN3050: Applied Logic in Engineering, introduced as a “logic for everybody” elective course at at TU Munich, Germany, to engage pupils studying Computer Science, IT and engineering subjects on Bachelor and Master levels. Our...