This paper is a study of similarities and differences between strong and weak quantum consequence operations determined by a given class of ortholattices. We prove that the only strong orthologics which admits the deduction theorem (the only strong orthologics with algebraic semantics, the only equivalential strong orthologics, respectively) is the classical logic. In the papers concerning quan...

We deene a logical semantics called back-and-forth, applicable to normal and disjunctive datalog programs as well as to programs possessing a second, explicit or`strong' negation operator. We show that on normal programs it is equivalent to the well-founded semantics (WFS), and that on disjunctive programs it is equivalent to the P-stable semantics of Eiter, Leone and Saccc a, hence to Przymusi...

We investigate a logical semantics which unambiguously speciies the meaning of SQL-like referential actions of the form ON DELETE CASCADE and ON DELETE RESTRICT. The semantics is given by a translation of referential actions into logical rules. The proposed semantics is less restrictive than the standard SQL semantics, yet preserves all referential integrity constraints. First, a preliminary se...

Recanati takes for granted the conveyance conception of linguistic communication, although it is not very clear exactly where he lies on the spectrum of possible variations. Even if we disavow all such conceptions of linguistic communication, there will be a place for semantic theory in articulating normative concepts such as logical consistency and logical validity. An approach to semantics fo...

Objects of consideration are various non-classical connectives “hidden” in the classical logic in the form of with — a classical connective, and — a propositional variable. One of them is negation, which is defined as ; another is necessity, which is defined as . The new operations are axiomatized and it is shown that they belong to the 4–valued logic of Łukasiewicz.A 2–point Kripke semantics i...

We introduce intuitionistic and classical substructural logics with structural rules mingle and connective strong negation, and investigate the cut-elimination property and the relevance principle for these logics. The relevance principle does not hold for substructural logics with mingle and usual negation, but holds for those with mingle and strong negation.

Following the idea that a classical proof is a superimposition of`constructive' proofs, we use the linear connective \&" to deene an embedding P a of polarized but non-constrained LK in linear logic, which induces a denotational semantics. A classical cut-elimination step is now a cut-elimination step in one of thèconstructive slices' superimposed by the classical proof.

In this sketchy paper we introduce a logical reconstruction of the RDF family of languages and the OWL-DL family of languages. We prove that our logical framework is equivalent to the normative W3C definitions of RDF/RDFS and OWL-DL/Lite. The main aim is to have a unified model theoretic semantics for both worlds. As a consequence we get various complexity results and a model theoretic semantic...

The sentential theory of propositional attitudes is very attractive to AI workers, but it is difficult to use such a theory to assign semantics to English sentences about attitudes. The problem is that a compositional semantics cannot easily build the logical forms that the theory requires. We present a new notation for a sentential theory, and a unification grammar that builds logical forms in...

In this sketchy paper we introduce a logical reconstruction of the RDF family of languages and the OWL-DL family of languages. We prove that our logical framework is equivalent to the standard W3C definitions of RDF and OWL-DL/Lite. The main aim is to have a unified model theoretic semantics for both worlds. As a consequence we get various complexity results and a model theoretic semantics for ...