The first volume of Springer-Verlag's Lecture Notes in Computer Science appeared in 1973, almost 22 years ago. The field has learned a lot about computing since then, and in doing so it has leaned on and supported advances in other fields. In this paper, we discuss an aspect of one of these fields that has been explored by computer scientists, handling undefined terms in formal logic. Logicians...

We compare two different modes of interaction with a large stereoscopic display, where the physical pointing device is in a volume distinct from the display volume. In absolute mode, the physical pointer’s position exactly maps to the virtual pointer’s position in the display volume, analogous to a 2D graphics table and 2D screen. In relative mode, the connection between the physical pointer’s ...

khunaji and his companions get influence from fakhr al-din razi and classified quantified propositions into two kinds: factual and external. abhari added the third kind which was named mental. tusi and his companions refuted khunaji’s viewpoint. analysis and explanation of the historical development of classification of predicative proposition into factual, external and mental is the problem of...

Quisani: Hello. It's that time of the year again when we have a discussion, isn't it? Author: Come on in. It is a busy time but I am happy to see you. Q: I am afraid my mood is rather critical today. A: That is all right. Speak your mind. Q: It is about computability and decidability. It seems to me that logicians' computability has little to do with real computability. Some so-called computabl...

In 1883, while a student of C. S. Peirce at Johns Hopkins University, Christine Ladd-Franklin published a paper titled On the Algebra of Logic, in which she develops an elegant and powerful test for the validity of syllogisms that constitutes the most significant advance in syllogistic logic in two thousand years.1 Sadly, her work has been all but forgotten by logicians and historians of logic....

Pocklington certificates are known to provide short proofs of primality. We show how to perform this in the framework of formal, mechanically checked, proofs. We present an encoding of certificates for the proof system Coq which yields radically improved performances by relying heavily on computations inside and outside of the system (twolevel approach). 1 Formal Computational Proofs 1.1 Machin...

BACKGROUND We sought to determine if a common polymorphism can influence vulnerability to LDL cholesterol, and thereby influence the clinical benefit derived from therapies that reduce LDL cholesterol. METHODS We conducted a meta-analysis of the association between a common Trp719Arg polymorphism in the kinesin-like protein 6 (KIF6) gene and the risk of cardiovascular disease (CVD), and a met...

Description logics are a family of knowledge representation formalisms that are descended from semantic networks and frames via the system KL-ONE. During the last decade, it has been shown that the important reasoning problems (like subsumption and satisfiability) in a great variety of description logics can be decided using tableau-like algorithms. This is not very surprising since description...

In one of his inaugural lectures Dov Gabbay demonstrated God’s providence as follows—I quote from memory. God had seen fit to send his revelation to mankind in a language with no verb tenses. (In classical Hebrew the verb forms are distinguished as perfective, imperfective, passive, reduplicative, etc., but not as past, present or future.) So there was a problem to explain how facts about a tem...