View in EDS PDF Full Text

Quantifier Elimination for Quantified Propositional Logics on Kripke Frames of Type ω.

Saved in:
Bibliographic Details
Title: Quantifier Elimination for Quantified Propositional Logics on Kripke Frames of Type ω.
Authors: BAAZ, MATTHIAS1 baaz@logic.at, PREINING, NORBERT1 preining@logic.at
Source: Journal of Logic & Computation. Aug2008, Vol. 18 Issue 4, p649-668. 20p.
Subjects: Mathematical logic, Combinatory logic, Mathematics, Computer software correctness, Logic machines, Model theory, Metamathematics, Set theory
Abstract: The minimal extension of intuitionistic propositional language is characterized, where propositional quantifiers are eliminable w.r.t. Kripke frames of type ω. [ABSTRACT FROM AUTHOR]
Copyright of Journal of Logic & Computation is the property of Oxford University Press / USA and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
FullText Links:
  – Type: pdflink
Text:
  Availability: 0
Header DbId: egs
DbLabel: Engineering Source
An: 34034898
AccessLevel: 6
PubType: Academic Journal
PubTypeId: academicJournal
PreciseRelevancyScore: 0
IllustrationInfo
Items – Name: Title
  Label: Title
  Group: Ti
  Data: Quantifier Elimination for Quantified Propositional Logics on Kripke Frames of Type ω.
– Name: Author
  Label: Authors
  Group: Au
  Data: <searchLink fieldCode="AR" term="%22BAAZ%2C+MATTHIAS%22">BAAZ, MATTHIAS</searchLink><relatesTo>1</relatesTo><i> baaz@logic.at</i><br /><searchLink fieldCode="AR" term="%22PREINING%2C+NORBERT%22">PREINING, NORBERT</searchLink><relatesTo>1</relatesTo><i> preining@logic.at</i>
– Name: TitleSource
  Label: Source
  Group: Src
  Data: <searchLink fieldCode="JN" term="%22Journal+of+Logic+%26+Computation%22">Journal of Logic & Computation</searchLink>. Aug2008, Vol. 18 Issue 4, p649-668. 20p.
– Name: Subject
  Label: Subjects
  Group: Su
  Data: <searchLink fieldCode="DE" term="%22Mathematical+logic%22">Mathematical logic</searchLink><br /><searchLink fieldCode="DE" term="%22Combinatory+logic%22">Combinatory logic</searchLink><br /><searchLink fieldCode="DE" term="%22Mathematics%22">Mathematics</searchLink><br /><searchLink fieldCode="DE" term="%22Computer+software+correctness%22">Computer software correctness</searchLink><br /><searchLink fieldCode="DE" term="%22Logic+machines%22">Logic machines</searchLink><br /><searchLink fieldCode="DE" term="%22Model+theory%22">Model theory</searchLink><br /><searchLink fieldCode="DE" term="%22Metamathematics%22">Metamathematics</searchLink><br /><searchLink fieldCode="DE" term="%22Set+theory%22">Set theory</searchLink>
– Name: Abstract
  Label: Abstract
  Group: Ab
  Data: The minimal extension of intuitionistic propositional language is characterized, where propositional quantifiers are eliminable w.r.t. Kripke frames of type ω. [ABSTRACT FROM AUTHOR]
– Name: AbstractSuppliedCopyright
  Label:
  Group: Ab
  Data: <i>Copyright of Journal of Logic & Computation is the property of Oxford University Press / USA and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract.</i> (Copyright applies to all Abstracts.)
PLink https://search.ebscohost.com/login.aspx?direct=true&site=eds-live&db=egs&AN=34034898
RecordInfo BibRecord:
  BibEntity:
    Languages:
      – Code: eng
        Text: English
    PhysicalDescription:
      Pagination:
        PageCount: 20
        StartPage: 649
    Subjects:
      – SubjectFull: Mathematical logic
        Type: general
      – SubjectFull: Combinatory logic
        Type: general
      – SubjectFull: Mathematics
        Type: general
      – SubjectFull: Computer software correctness
        Type: general
      – SubjectFull: Logic machines
        Type: general
      – SubjectFull: Model theory
        Type: general
      – SubjectFull: Metamathematics
        Type: general
      – SubjectFull: Set theory
        Type: general
    Titles:
      – TitleFull: Quantifier Elimination for Quantified Propositional Logics on Kripke Frames of Type ω.
        Type: main
  BibRelationships:
    HasContributorRelationships:
      – PersonEntity:
          Name:
            NameFull: BAAZ, MATTHIAS
      – PersonEntity:
          Name:
            NameFull: PREINING, NORBERT
    IsPartOfRelationships:
      – BibEntity:
          Dates:
            – D: 01
              M: 08
              Text: Aug2008
              Type: published
              Y: 2008
          Identifiers:
            – Type: issn-print
              Value: 0955792X
          Numbering:
            – Type: volume
              Value: 18
            – Type: issue
              Value: 4
          Titles:
            – TitleFull: Journal of Logic & Computation
              Type: main
ResultId 1