In my contribution I will provide an outline of how two major strands in Löbner’s work can be combined in a dynamic game-theoretical semantics: phase quantiVcation (PQ) and frame theory (FT). In a Vrst step a formal analysis of PQ in (dynamic) arrow logic is presented. Based on this analysis it is shown in the second step that frame theory must not be understood as being an alternative to stand...

All practical digital circuits are usually a mixture of combinational and sequential logic. Flip–flops are essential to sequential logic therefore fuzzy flip–flops are considered to be among the most essential topics of fuzzy digital circuit. The concept of fuzzy digital circuit is among the most interesting applications of fuzzy sets and logic due to the fact that if there has to be an ultimat...

For the formal verification of security in mobile networks, a requirement is that security policies associated with mobility and location constraints are formally specified and verified. For the formal specification and verification of security policies, formal methods ensure that a given network configuration that includes certain network elements satisfies a given security policy. A process c...

Much work in MKM depends on the application of formal logic to mathematics. However, much mathematical knowledge is informal. Luckily, formal logic only represents one tradition in logic, specifically the modeling of inference in terms of logical form. Many inferences cannot be captured in this manner. The study of such inferences is still within the domain of logic, and is sometimes called inf...

Abstract According to Bocheński’s description of the history formal logic, there clearly is some objective development, though far from being cumulative or linear. The logic throughout world consists three relatively short pinnacles preceded by also periods awakening and followed extensive commentary running into long standstill decadence, when nearly all achievements are consigned oblivion.

Context-free at t r ibute grammars are proposed as derivational models for proofs in the predicate calculus. The new representation is developed and i t s correspondence to resolution-based clause i n terconnectivity graphs is established. The new representation may be used to transform a predicate calculus characterization of a problem into a regular algebra characterization of the solutions. ...

In the same sense as classical logic is a formal theory of truth, the recently initiated approach called computability logic (CL) is a formal theory of computability — in particular, a theory of interactive computability. It understands computational problems as games played by a machine against the environment, their computability as existence of a machine that always wins the game, logical op...

One of the goals of synthetic biology is to build genetic circuits to control the behavior of a cell for different application domains, such as medical, environmental, and biotech. During the design process of genetic circuits, biologists are often interested in the probability of a system to work under different conditions. Since genetic circuits are noisy and stochastic in nature, the verific...

This note aims to clarify the relations between three ways of constructing complete lattices that appear in different areas: (1) using ordered structures, as set-theoretic forcing, or doubly a recent semantics for intuitionistic logic; (2) compatibility relations, quantum logic based on ortholattices; (3) Birkhoff’s polarities, formal concept analysis.

This is a Haskell implementation of Decisive Plausible Logic.1 Decisive Plausible Logic is a new variant of Plausible Logic that handles the looping that complicated previous implementations explicitly, and is defined in terms of a proof function with a three-valued result like the previous implementations, though these essential attributes were not reflected in the formal definition of the logic.