Numerous informal logicians and argumentation theorists restrict their theorizing to what they call “real” arguments. But is there a clear distinction to be made between “real” and “non-real” arguments? Here I explore four possible accounts of the alleged distinction and argue that none can serve the theoretical uses to which the distinction is most often put. Résumé: Plusieurs logiciens non fo...

Interpolation (together with completeness and decidability) has become one of the standard properties that logicians investigate when designing a logic. In this paper, we provide strong evidence that the presence of interpolants is not only cogent for scientific reasoning but has also important practical implications in computer science. We illustrate that interpolation in general, and uniform ...

One of the surprising developments in the area of program verification is how ideas introduced by logicians in the early part of the 20th Century ended up yielding by the 21 Century industrial-standard property-specification languages. This development was enabled by the equally unlikely transformation of the mathematical machinery of automata on infinite words, introduced in the early 1960s fo...

There are some statements that are independent of Zermelo-Frankl Set Theory (henceforth ZFC). Such statements cannot be proven or disproven by conventional mathematics. The Continuum Hypothesis is one such statement (“There is no cardinality strictly between א0 and 2א0 .”) Many such statements are unnatural in that they deal with objects only set theorists and other logicians care about. We pre...

ions The description of the meaning of expressions just given above is vague and intuitive It took about years for logicians Dana Scott in fact to make it rigorous in a useful way We shall not be going into details of this Example x x denotes the identity function x x E E Example x f f x denotes the function which when applied to E yields f f x E x i e f f E This is the function which when appl...

We characterize four types of agentive knowledge using a stit semantics over branching discrete-time structures. These are ex ante knowledge, interim post and know-how. The first three notions that arose from game-theoretical analyses on the stages information disclosure across decision making process, fourth has gained prominence both in logics action deontic logic as means to formalize abilit...

This paper is intended to give for a general mathematical audience (including non logicians) a survey about intriguing connections between analytic combinatorics and logic. We define the ordinals below ε0 in non-logical terms and we survey a selection of recent results about the analytic combinatorics of these ordinals. Using a versatile and flexible (logarithmic) compression technique we give ...

The tableau method is widely used by logicians to give decision procedure for classical and non classical logics. But the move from proof-theoretic tool to an efficient automated theorem prover is often difficult for researchers with no technical background. The main “problem” is the non-determinism inherent in the tableau method. In this paper we give a functional algorithm to mechanize the ta...

In this paper, we revisit a central concept in Kolmogorov complexity in which one would equate program-size complexity with information content. Despite the fact that Kolmogorov complexity has been widely accepted as an objective measure of the information content of a string, it has been the subject of many criticisms including the fundamental one directed by logicians and philosophers towards...

In the spirit of this enlightening conversation and indeed of this entire volume—promoting mutual understanding and learning between philosophers, logicians and linguists working on vagueness related issues—I shall in these comments consider three points, which if not kept in mind have significant potential to promote misunderstanding between practitioners of these three disciplines. All three ...