Choiceless polynomial time logic: Inability to express

Saharon Shelah

doi:10.1007/3-540-44622-2_6

Choiceless polynomial time logic: Inability to express

Saharon Shelah^*

^*Corresponding author for this work

Einstein Institute of Mathematics

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

8 Scopus citations

Abstract

We prove for the logic CPTime (the logic from the title) a sufficientcondition for two models to be equivalent for any set of sentences which is “small”(certainly any finite set), parallel to the Ehrenfeucht Fraïssé games. This enablesus to show that sentences cannot express some properties in the logicCPTime and prove 0-1 laws for it.

Original language	English
Title of host publication	Computer Science Logic - 14th International Workshop, CSL 2000, Annual Conference of the EACSL, Proceedings
Editors	Peter G. Clote, Helmut Schwichtenberg
Publisher	Springer Verlag
Pages	72-125
Number of pages	54
ISBN (Print)	3540678956, 9783540678953
DOIs	https://doi.org/10.1007/3-540-44622-2_6
State	Published - 2000
Event	14th International Workshop on Computer Science Logic, CSL 2000 and Annual Conference of the European Association for Computer Science Logic, EACSL 2000 - Fischbachau, Germany Duration: 21 Aug 2000 → 26 Aug 2000

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	1862
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	14th International Workshop on Computer Science Logic, CSL 2000 and Annual Conference of the European Association for Computer Science Logic, EACSL 2000
Country/Territory	Germany
City	Fischbachau
Period	21/08/00 → 26/08/00

Bibliographical note

Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2000.

Keywords

Choiceless
Computer science
Finite model theory
Games
Polynomial time logic

Access to Document

10.1007/3-540-44622-2_6

Cite this

Shelah, S. (2000). Choiceless polynomial time logic: Inability to express. In P. G. Clote, & H. Schwichtenberg (Eds.), Computer Science Logic - 14th International Workshop, CSL 2000, Annual Conference of the EACSL, Proceedings (pp. 72-125). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1862). Springer Verlag. https://doi.org/10.1007/3-540-44622-2_6

Shelah, Saharon. / Choiceless polynomial time logic : Inability to express. Computer Science Logic - 14th International Workshop, CSL 2000, Annual Conference of the EACSL, Proceedings. editor / Peter G. Clote ; Helmut Schwichtenberg. Springer Verlag, 2000. pp. 72-125 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{32e92ff4861f4cd29bae22a061f1986c,

title = "Choiceless polynomial time logic: Inability to express",

abstract = "We prove for the logic CPTime (the logic from the title) a sufficientcondition for two models to be equivalent for any set of sentences which is “small”(certainly any finite set), parallel to the Ehrenfeucht Fra{\"i}ss{\'e} games. This enablesus to show that sentences cannot express some properties in the logicCPTime and prove 0-1 laws for it.",

keywords = "Choiceless, Computer science, Finite model theory, Games, Polynomial time logic",

author = "Saharon Shelah",

note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2000.; 14th International Workshop on Computer Science Logic, CSL 2000 and Annual Conference of the European Association for Computer Science Logic, EACSL 2000 ; Conference date: 21-08-2000 Through 26-08-2000",

year = "2000",

doi = "10.1007/3-540-44622-2_6",

language = "אנגלית",

isbn = "3540678956",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "72--125",

editor = "Clote, {Peter G.} and Helmut Schwichtenberg",

booktitle = "Computer Science Logic - 14th International Workshop, CSL 2000, Annual Conference of the EACSL, Proceedings",

address = "גרמניה",

}

Shelah, S 2000, Choiceless polynomial time logic: Inability to express. in PG Clote & H Schwichtenberg (eds), Computer Science Logic - 14th International Workshop, CSL 2000, Annual Conference of the EACSL, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 1862, Springer Verlag, pp. 72-125, 14th International Workshop on Computer Science Logic, CSL 2000 and Annual Conference of the European Association for Computer Science Logic, EACSL 2000, Fischbachau, Germany, 21/08/00. https://doi.org/10.1007/3-540-44622-2_6

Choiceless polynomial time logic: Inability to express. / Shelah, Saharon.
Computer Science Logic - 14th International Workshop, CSL 2000, Annual Conference of the EACSL, Proceedings. ed. / Peter G. Clote; Helmut Schwichtenberg. Springer Verlag, 2000. p. 72-125 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1862).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Choiceless polynomial time logic

T2 - 14th International Workshop on Computer Science Logic, CSL 2000 and Annual Conference of the European Association for Computer Science Logic, EACSL 2000

AU - Shelah, Saharon

N1 - Publisher Copyright: © Springer-Verlag Berlin Heidelberg 2000.

PY - 2000

Y1 - 2000

N2 - We prove for the logic CPTime (the logic from the title) a sufficientcondition for two models to be equivalent for any set of sentences which is “small”(certainly any finite set), parallel to the Ehrenfeucht Fraïssé games. This enablesus to show that sentences cannot express some properties in the logicCPTime and prove 0-1 laws for it.

AB - We prove for the logic CPTime (the logic from the title) a sufficientcondition for two models to be equivalent for any set of sentences which is “small”(certainly any finite set), parallel to the Ehrenfeucht Fraïssé games. This enablesus to show that sentences cannot express some properties in the logicCPTime and prove 0-1 laws for it.

KW - Choiceless

KW - Computer science

KW - Finite model theory

KW - Games

KW - Polynomial time logic

UR - http://www.scopus.com/inward/record.url?scp=0001894545&partnerID=8YFLogxK

U2 - 10.1007/3-540-44622-2_6

DO - 10.1007/3-540-44622-2_6

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:0001894545

SN - 3540678956

SN - 9783540678953

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 72

EP - 125

BT - Computer Science Logic - 14th International Workshop, CSL 2000, Annual Conference of the EACSL, Proceedings

A2 - Clote, Peter G.

A2 - Schwichtenberg, Helmut

PB - Springer Verlag

Y2 - 21 August 2000 through 26 August 2000

ER -

Shelah S. Choiceless polynomial time logic: Inability to express. In Clote PG, Schwichtenberg H, editors, Computer Science Logic - 14th International Workshop, CSL 2000, Annual Conference of the EACSL, Proceedings. Springer Verlag. 2000. p. 72-125. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-44622-2_6

Choiceless polynomial time logic: Inability to express

Abstract

Publication series

Conference

Bibliographical note

Keywords

Access to Document

Other files and links

Fingerprint

Cite this