Propositional vs. Predicate Logics

  • Ryszard Wójcicki
Part of the Synthese Library book series (SYLI, volume 199)


A predicate language over a propositional language S is a couple qS = (S,q) where q is the signature of qS, i.e. the function which divides descriptive terms D(q) of qS into syntactical categories. All predicate languages involve the sets V f and V b of free and bound individual variables, resp., connectives of S, and quantifiers ∀ ∃. The notions of a term, formula, and sentence of qS are defined in the usual way. A predicate language qS 0 over the propositional language S 0 = (S 0, →, Λ, V, ¬) is called basic.


Free Variable Function Symbol Predicate Logic Relation Symbol Individual Constant 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media Dordrecht 1988

Authors and Affiliations

  • Ryszard Wójcicki
    • 1
  1. 1.Section of Logic, Institute of Philosophy and SociologyPolish Academy of SciencesPoland

Personalised recommendations