Supplement to “symmetric Propositions and Logical Quantifiers”

نویسنده

  • R. GREGORY TAYLOR
چکیده

This document contains propositions, proofs, and supplementary discussion supporting claims made in the paper “Symmetric propositions and logical quantifiers,” Journal of philosophical logic, forthcoming (henceforth SPLQ). Unless explicitly mentioned otherwise, all references are internal. Section, but not subsection, headings correspond to those of SPLQ. (The latter has no subsections.)

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Grishin Algebras and Cover Systems for Classical Bilinear Logic

Grishin algebras are a generalisation of Boolean algebras that provide algebraic models for classical bilinear logic with two mutually cancelling negation connectives. We show how to build complete Grishin algebras as algebras of certain subsets (“propositions”) of cover systems that use an orthogonality relation to interpret the negations. The variety of Grishin algebras is shown to be closed ...

متن کامل

A Classical First Order Language

The aim is to construct a language for the classical predicate calculus. The language is defined as a subset of the language constructed in [7]. Well-formed formulas of this language are defined and some usual connectives and quantifiers of [7], [1] are accordingly. We prove inductive and definitional schemes for formulas of our language. Substitution for individual variables in formulas of the...

متن کامل

Quantified CTL: Expressiveness and Complexity

While it was defined long ago, the extension of CTL with quantification over atomic propositions has never been studied extensively. Considering two different semantics (depending whether propositional quantification refers to the Kripke structure or to its unwinding tree), we study its expressiveness (showing in particular that QCTL coincides with Monadic Second-Order Logic for both semantics)...

متن کامل

A Categorical Semantics for Linear Logical Frameworks

A type theory is presented that combines (intuitionistic) linear types with type dependency, thus properly generalising both intuitionistic dependent type theory and full linear logic. A syntax and complete categorical semantics are developed, the latter in terms of (strict) indexed symmetric monoidal categories with comprehension. Various optional type formers are treated in a modular way. In ...

متن کامل

A History of The Connectives

Contemporary students of logic tend to think of the logic of the connectives as the most basic area of the subject, which can then be extended with a logic of quantifiers. Historically, however, the logic of the quantifiers, in the form of the Aristotelian theory of the syllogism, came first. Truth conditions for negation, conjunction, and disjunction were well understood in ancient times, thou...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010