Second-Order Logic over Finite Structures – Report on a Research Programme
Identifieur interne : 002299 ( Istex/Corpus ); précédent : 002298; suivant : 002300Second-Order Logic over Finite Structures – Report on a Research Programme
Auteurs : Georg GottlobSource :
- Lecture Notes in Computer Science [ 0302-9743 ]
Abstract
Abstract: This paper reports about the results achieved so far in the context of a research programme at the cutting point of logic, formal language theory, and complexity theory. The aim of this research programme is to classify the complexity of evaluating formulas from different prefix classes of second-order logic over different types of finite structures, such as strings, graphs, or arbitrary structures. In particular, we report on classifications of second-order logic on strings and of existential second-order logic on graphs.
Url:
DOI: 10.1007/978-3-540-25984-8_16
Links to Exploration step
ISTEX:959C346C4BEC0856416C1648C45906C5377CB885Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Second-Order Logic over Finite Structures – Report on a Research Programme</title>
<author><name sortKey="Gottlob, Georg" sort="Gottlob, Georg" uniqKey="Gottlob G" first="Georg" last="Gottlob">Georg Gottlob</name>
<affiliation><mods:affiliation>Institut für Informationssysteme, Technische Universität Wien, Favoritenstraße 9-11, A-1040, Wien, Austria</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: gottlob@dbai.tuwien.ac.at</mods:affiliation>
</affiliation>
</author>
</titleStmt>
<publicationStmt><idno type="wicri:source">ISTEX</idno>
<idno type="RBID">ISTEX:959C346C4BEC0856416C1648C45906C5377CB885</idno>
<date when="2004" year="2004">2004</date>
<idno type="doi">10.1007/978-3-540-25984-8_16</idno>
<idno type="url">https://api.istex.fr/ark:/67375/HCB-076LZMFH-M/fulltext.pdf</idno>
<idno type="wicri:Area/Istex/Corpus">002299</idno>
<idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">002299</idno>
</publicationStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Second-Order Logic over Finite Structures – Report on a Research Programme</title>
<author><name sortKey="Gottlob, Georg" sort="Gottlob, Georg" uniqKey="Gottlob G" first="Georg" last="Gottlob">Georg Gottlob</name>
<affiliation><mods:affiliation>Institut für Informationssysteme, Technische Universität Wien, Favoritenstraße 9-11, A-1040, Wien, Austria</mods:affiliation>
</affiliation>
<affiliation><mods:affiliation>E-mail: gottlob@dbai.tuwien.ac.at</mods:affiliation>
</affiliation>
</author>
</analytic>
<monogr></monogr>
<series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title>
<idno type="ISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
<idno type="ISSN">0302-9743</idno>
</series>
</biblStruct>
</sourceDesc>
<seriesStmt><idno type="ISSN">0302-9743</idno>
</seriesStmt>
</fileDesc>
<profileDesc><textClass></textClass>
</profileDesc>
</teiHeader>
<front><div type="abstract" xml:lang="en">Abstract: This paper reports about the results achieved so far in the context of a research programme at the cutting point of logic, formal language theory, and complexity theory. The aim of this research programme is to classify the complexity of evaluating formulas from different prefix classes of second-order logic over different types of finite structures, such as strings, graphs, or arbitrary structures. In particular, we report on classifications of second-order logic on strings and of existential second-order logic on graphs.</div>
</front>
</TEI>
<istex><corpusName>springer-ebooks</corpusName>
<author><json:item><name>Georg Gottlob</name>
<affiliations><json:string>Institut für Informationssysteme, Technische Universität Wien, Favoritenstraße 9-11, A-1040, Wien, Austria</json:string>
<json:string>E-mail: gottlob@dbai.tuwien.ac.at</json:string>
</affiliations>
</json:item>
</author>
<arkIstex>ark:/67375/HCB-076LZMFH-M</arkIstex>
<language><json:string>eng</json:string>
</language>
<originalGenre><json:string>OriginalPaper</json:string>
</originalGenre>
<abstract>Abstract: This paper reports about the results achieved so far in the context of a research programme at the cutting point of logic, formal language theory, and complexity theory. The aim of this research programme is to classify the complexity of evaluating formulas from different prefix classes of second-order logic over different types of finite structures, such as strings, graphs, or arbitrary structures. In particular, we report on classifications of second-order logic on strings and of existential second-order logic on graphs.</abstract>
<qualityIndicators><refBibsNative>false</refBibsNative>
<abstractWordCount>81</abstractWordCount>
<abstractCharCount>538</abstractCharCount>
<keywordCount>0</keywordCount>
<score>7.972</score>
<pdfWordCount>6329</pdfWordCount>
<pdfCharCount>35155</pdfCharCount>
<pdfVersion>1.3</pdfVersion>
<pdfPageCount>15</pdfPageCount>
<pdfPageSize>430 x 660 pts</pdfPageSize>
</qualityIndicators>
<title>Second-Order Logic over Finite Structures – Report on a Research Programme</title>
<chapterId><json:string>16</json:string>
<json:string>Chap16</json:string>
</chapterId>
<genre><json:string>conference</json:string>
</genre>
<serie><title>Lecture Notes in Computer Science</title>
<language><json:string>unknown</json:string>
</language>
<copyrightDate>2004</copyrightDate>
<issn><json:string>0302-9743</json:string>
</issn>
<eissn><json:string>1611-3349</json:string>
</eissn>
<editor><json:item><name>Takeo Kanade</name>
<affiliations><json:string>Carnegie Mellon University, Pittsburgh, PA, USA</json:string>
</affiliations>
</json:item>
<json:item><name>Josef Kittler</name>
<affiliations><json:string>University of Surrey, Guildford, UK</json:string>
</affiliations>
</json:item>
<json:item><name>Jon M. Kleinberg</name>
<affiliations><json:string>Cornell University, Ithaca, NY, USA</json:string>
</affiliations>
</json:item>
<json:item><name>Friedemann Mattern</name>
<affiliations><json:string>ETH Zurich, Switzerland</json:string>
</affiliations>
</json:item>
<json:item><name>John C. Mitchell</name>
<affiliations><json:string>Stanford University, CA, USA</json:string>
</affiliations>
</json:item>
<json:item><name>Moni Naor</name>
<affiliations><json:string>Weizmann Institute of Science, Rehovot, Israel</json:string>
</affiliations>
</json:item>
<json:item><name>Oscar Nierstrasz</name>
<affiliations><json:string>University of Bern, Switzerland</json:string>
</affiliations>
</json:item>
<json:item><name>C. Pandu Rangan</name>
<affiliations><json:string>Indian Institute of Technology, Madras, India</json:string>
</affiliations>
</json:item>
<json:item><name>Bernhard Steffen</name>
<affiliations><json:string>University of Dortmund, Germany</json:string>
</affiliations>
</json:item>
<json:item><name>Madhu Sudan</name>
<affiliations><json:string>Massachusetts Institute of Technology, MA, USA</json:string>
</affiliations>
</json:item>
<json:item><name>Demetri Terzopoulos</name>
<affiliations><json:string>New York University, NY, USA</json:string>
</affiliations>
</json:item>
<json:item><name>Dough Tygar</name>
<affiliations><json:string>University of California, Berkeley, CA, USA</json:string>
</affiliations>
</json:item>
<json:item><name>Moshe Y. Vardi</name>
<affiliations><json:string>Rice University, Houston, TX, USA</json:string>
</affiliations>
</json:item>
<json:item><name>Gerhard Weikum</name>
<affiliations><json:string>Max-Planck Institute of Computer Science, Saarbruecken, Germany</json:string>
</affiliations>
</json:item>
</editor>
</serie>
<host><title>Automated Reasoning</title>
<language><json:string>unknown</json:string>
</language>
<copyrightDate>2004</copyrightDate>
<doi><json:string>10.1007/b98691</json:string>
</doi>
<issn><json:string>0302-9743</json:string>
</issn>
<eissn><json:string>1611-3349</json:string>
</eissn>
<eisbn><json:string>978-3-540-25984-8</json:string>
</eisbn>
<bookId><json:string>978-3-540-25984-8</json:string>
</bookId>
<isbn><json:string>978-3-540-22345-0</json:string>
</isbn>
<volume>3097</volume>
<pages><first>229</first>
<last>243</last>
</pages>
<genre><json:string>book-series</json:string>
</genre>
<editor><json:item><name>David Basin</name>
<affiliations><json:string>Information Security Group, Dep. of Computer Science, ETH, Zurich, Switzerland</json:string>
<json:string>E-mail: basin@inf.ethz.ch</json:string>
</affiliations>
</json:item>
<json:item><name>Michaël Rusinowitch</name>
<affiliations><json:string>LORIA & INRIA Lorraine UMR 7503,</json:string>
<json:string>E-mail: rusi@loria.fr</json:string>
</affiliations>
</json:item>
</editor>
<subject><json:item><value>Computer Science</value>
</json:item>
<json:item><value>Computer Science</value>
</json:item>
<json:item><value>Artificial Intelligence (incl. Robotics)</value>
</json:item>
<json:item><value>Mathematical Logic and Formal Languages</value>
</json:item>
<json:item><value>Logics and Meanings of Programs</value>
</json:item>
<json:item><value>Software Engineering</value>
</json:item>
</subject>
</host>
<ark><json:string>ark:/67375/HCB-076LZMFH-M</json:string>
</ark>
<publicationDate>2004</publicationDate>
<copyrightDate>2004</copyrightDate>
<doi><json:string>10.1007/978-3-540-25984-8_16</json:string>
</doi>
<id>959C346C4BEC0856416C1648C45906C5377CB885</id>
<score>1</score>
<fulltext><json:item><extension>pdf</extension>
<original>true</original>
<mimetype>application/pdf</mimetype>
<uri>https://api.istex.fr/ark:/67375/HCB-076LZMFH-M/fulltext.pdf</uri>
</json:item>
<json:item><extension>zip</extension>
<original>false</original>
<mimetype>application/zip</mimetype>
<uri>https://api.istex.fr/ark:/67375/HCB-076LZMFH-M/bundle.zip</uri>
</json:item>
<istex:fulltextTEI uri="https://api.istex.fr/ark:/67375/HCB-076LZMFH-M/fulltext.tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Second-Order Logic over Finite Structures – Report on a Research Programme</title>
</titleStmt>
<publicationStmt><authority>ISTEX</authority>
<availability><licence>Springer-Verlag Berlin Heidelberg</licence>
</availability>
<date when="2004">2004</date>
</publicationStmt>
<notesStmt><note type="conference" source="proceedings" scheme="https://content-type.data.istex.fr/ark:/67375/XTP-BFHXPBJJ-3">conference</note>
<note type="publication-type" subtype="book-series" scheme="https://publication-type.data.istex.fr/ark:/67375/JMC-0G6R5W5T-Z">book-series</note>
</notesStmt>
<sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Second-Order Logic over Finite Structures – Report on a Research Programme</title>
<author><persName><forename type="first">Georg</forename>
<surname>Gottlob</surname>
</persName>
<email>gottlob@dbai.tuwien.ac.at</email>
<affiliation><orgName type="department">Institut für Informationssysteme</orgName>
<orgName type="institution">Technische Universität Wien</orgName>
<address><street>Favoritenstraße 9-11</street>
<postCode>A-1040</postCode>
<settlement>Wien</settlement>
<country key="AT">AUSTRIA</country>
</address>
</affiliation>
</author>
<idno type="istex">959C346C4BEC0856416C1648C45906C5377CB885</idno>
<idno type="ark">ark:/67375/HCB-076LZMFH-M</idno>
<idno type="DOI">10.1007/978-3-540-25984-8_16</idno>
</analytic>
<monogr><title level="m" type="main">Automated Reasoning</title>
<title level="m" type="sub">Second International Joint Conference, IJCAR 2004, Cork, Ireland, July 4-8, 2004. Proceedings</title>
<title level="m" type="part">Reasoning with Finite Structure</title>
<idno type="DOI">10.1007/b98691</idno>
<idno type="book-id">978-3-540-25984-8</idno>
<idno type="ISBN">978-3-540-22345-0</idno>
<idno type="eISBN">978-3-540-25984-8</idno>
<idno type="chapter-id">Chap16</idno>
<idno type="part-id">Part5</idno>
<editor><persName><forename type="first">David</forename>
<surname>Basin</surname>
</persName>
<email>basin@inf.ethz.ch</email>
<affiliation><orgName type="department">Information Security Group, Dep. of Computer Science</orgName>
<orgName type="institution">ETH</orgName>
<address><settlement>Zurich</settlement>
<country key="CH">SWITZERLAND</country>
</address>
</affiliation>
</editor>
<editor><persName><forename type="first">Michaël</forename>
<surname>Rusinowitch</surname>
</persName>
<email>rusi@loria.fr</email>
<affiliation><orgName type="institution">LORIA & INRIA Lorraine UMR 7503</orgName>
<address><country key=""></country>
</address>
</affiliation>
</editor>
<imprint><biblScope unit="vol">3097</biblScope>
<biblScope unit="page" from="229">229</biblScope>
<biblScope unit="page" to="243">243</biblScope>
<biblScope unit="chapter-count">36</biblScope>
<biblScope unit="part-chapter-count">2</biblScope>
</imprint>
</monogr>
<series><title level="s" type="main" xml:lang="en">Lecture Notes in Computer Science</title>
<editor><persName><forename type="first">Takeo</forename>
<surname>Kanade</surname>
</persName>
<affiliation><orgName type="institution">Carnegie Mellon University</orgName>
<address><settlement>Pittsburgh</settlement>
<region>PA</region>
<country key="US">UNITED STATES</country>
</address>
</affiliation>
</editor>
<editor><persName><forename type="first">Josef</forename>
<surname>Kittler</surname>
</persName>
<affiliation><orgName type="institution">University of Surrey</orgName>
<address><settlement>Guildford</settlement>
<country key="GB">UNITED KINGDOM</country>
</address>
</affiliation>
</editor>
<editor><persName><forename type="first">Jon</forename>
<forename type="first">M.</forename>
<surname>Kleinberg</surname>
</persName>
<affiliation><orgName type="institution">Cornell University</orgName>
<address><settlement>Ithaca</settlement>
<region>NY</region>
<country key="US">UNITED STATES</country>
</address>
</affiliation>
</editor>
<editor><persName><forename type="first">Friedemann</forename>
<surname>Mattern</surname>
</persName>
<affiliation><orgName type="institution">ETH Zurich</orgName>
<address><country key="CH">SWITZERLAND</country>
</address>
</affiliation>
</editor>
<editor><persName><forename type="first">John</forename>
<forename type="first">C.</forename>
<surname>Mitchell</surname>
</persName>
<affiliation><orgName type="institution">Stanford University</orgName>
<address><settlement>CA</settlement>
<country key="US">UNITED STATES</country>
</address>
</affiliation>
</editor>
<editor><persName><forename type="first">Moni</forename>
<surname>Naor</surname>
</persName>
<affiliation><orgName type="institution">Weizmann Institute of Science</orgName>
<address><settlement>Rehovot</settlement>
<country key="IL">ISRAEL</country>
</address>
</affiliation>
</editor>
<editor><persName><forename type="first">Oscar</forename>
<surname>Nierstrasz</surname>
</persName>
<affiliation><orgName type="institution">University of Bern</orgName>
<address><country key="CH">SWITZERLAND</country>
</address>
</affiliation>
</editor>
<editor><persName><forename type="first">C.</forename>
<surname>Pandu Rangan</surname>
</persName>
<affiliation><orgName type="institution">Indian Institute of Technology</orgName>
<address><settlement>Madras</settlement>
<country key="IN">INDIA</country>
</address>
</affiliation>
</editor>
<editor><persName><forename type="first">Bernhard</forename>
<surname>Steffen</surname>
</persName>
<affiliation><orgName type="institution">University of Dortmund</orgName>
<address><country key="DE">GERMANY</country>
</address>
</affiliation>
</editor>
<editor><persName><forename type="first">Madhu</forename>
<surname>Sudan</surname>
</persName>
<affiliation><orgName type="institution">Massachusetts Institute of Technology</orgName>
<address><settlement>MA</settlement>
<country key="US">UNITED STATES</country>
</address>
</affiliation>
</editor>
<editor><persName><forename type="first">Demetri</forename>
<surname>Terzopoulos</surname>
</persName>
<affiliation><orgName type="institution">New York University</orgName>
<address><settlement>NY</settlement>
<country key="US">UNITED STATES</country>
</address>
</affiliation>
</editor>
<editor><persName><forename type="first">Dough</forename>
<surname>Tygar</surname>
</persName>
<affiliation><orgName type="institution">University of California</orgName>
<address><settlement>Berkeley</settlement>
<region>CA</region>
<country key="US">UNITED STATES</country>
</address>
</affiliation>
</editor>
<editor><persName><forename type="first">Moshe</forename>
<forename type="first">Y.</forename>
<surname>Vardi</surname>
</persName>
<affiliation><orgName type="institution">Rice University</orgName>
<address><settlement>Houston</settlement>
<region>TX</region>
<country key="US">UNITED STATES</country>
</address>
</affiliation>
</editor>
<editor><persName><forename type="first">Gerhard</forename>
<surname>Weikum</surname>
</persName>
<affiliation><orgName type="institution">Max-Planck Institute of Computer Science</orgName>
<address><settlement>Saarbruecken</settlement>
<country key="DE">GERMANY</country>
</address>
</affiliation>
</editor>
<idno type="pISSN">0302-9743</idno>
<idno type="eISSN">1611-3349</idno>
<idno type="seriesID">558</idno>
</series>
</biblStruct>
</sourceDesc>
</fileDesc>
<profileDesc><abstract xml:lang="en"><head>Abstract</head>
<p>This paper reports about the results achieved so far in the context of a research programme at the cutting point of logic, formal language theory, and complexity theory. The aim of this research programme is to classify the complexity of evaluating formulas from different prefix classes of second-order logic over different types of finite structures, such as strings, graphs, or arbitrary structures. In particular, we report on classifications of second-order logic on strings and of existential second-order logic on graphs.</p>
</abstract>
<textClass ana="subject"><keywords scheme="book-subject-collection"><list><label>SUCO11645</label>
<item><term>Computer Science</term>
</item>
</list>
</keywords>
</textClass>
<textClass ana="subject"><keywords scheme="book-subject"><list><label>I</label>
<item><term type="Primary">Computer Science</term>
</item>
<label>I21017</label>
<item><term type="Secondary" subtype="priority-1">Artificial Intelligence (incl. Robotics)</term>
</item>
<label>I16048</label>
<item><term type="Secondary" subtype="priority-2">Mathematical Logic and Formal Languages</term>
</item>
<label>I1603X</label>
<item><term type="Secondary" subtype="priority-3">Logics and Meanings of Programs</term>
</item>
<label>I14029</label>
<item><term type="Secondary" subtype="priority-4">Software Engineering</term>
</item>
</list>
</keywords>
</textClass>
<langUsage><language ident="EN"></language>
</langUsage>
</profileDesc>
</teiHeader>
</istex:fulltextTEI>
<json:item><extension>txt</extension>
<original>false</original>
<mimetype>text/plain</mimetype>
<uri>https://api.istex.fr/ark:/67375/HCB-076LZMFH-M/fulltext.txt</uri>
</json:item>
</fulltext>
<metadata><istex:metadataXml wicri:clean="corpus springer-ebooks not found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration>
<istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType>
<istex:document><Publisher><PublisherInfo><PublisherName>Springer Berlin Heidelberg</PublisherName>
<PublisherLocation>Berlin, Heidelberg</PublisherLocation>
</PublisherInfo>
<Series><SeriesInfo SeriesType="Series" TocLevels="0"><SeriesID>558</SeriesID>
<SeriesPrintISSN>0302-9743</SeriesPrintISSN>
<SeriesElectronicISSN>1611-3349</SeriesElectronicISSN>
<SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle>
</SeriesInfo>
<SeriesHeader><EditorGroup><Editor AffiliationIDS="Aff1"><EditorName DisplayOrder="Western"><GivenName>Takeo</GivenName>
<FamilyName>Kanade</FamilyName>
</EditorName>
</Editor>
<Editor AffiliationIDS="Aff2"><EditorName DisplayOrder="Western"><GivenName>Josef</GivenName>
<FamilyName>Kittler</FamilyName>
</EditorName>
</Editor>
<Editor AffiliationIDS="Aff3"><EditorName DisplayOrder="Western"><GivenName>Jon</GivenName>
<GivenName>M.</GivenName>
<FamilyName>Kleinberg</FamilyName>
</EditorName>
</Editor>
<Editor AffiliationIDS="Aff4"><EditorName DisplayOrder="Western"><GivenName>Friedemann</GivenName>
<FamilyName>Mattern</FamilyName>
</EditorName>
</Editor>
<Editor AffiliationIDS="Aff5"><EditorName DisplayOrder="Western"><GivenName>John</GivenName>
<GivenName>C.</GivenName>
<FamilyName>Mitchell</FamilyName>
</EditorName>
</Editor>
<Editor AffiliationIDS="Aff6"><EditorName DisplayOrder="Western"><GivenName>Moni</GivenName>
<FamilyName>Naor</FamilyName>
</EditorName>
</Editor>
<Editor AffiliationIDS="Aff7"><EditorName DisplayOrder="Western"><GivenName>Oscar</GivenName>
<FamilyName>Nierstrasz</FamilyName>
</EditorName>
</Editor>
<Editor AffiliationIDS="Aff8"><EditorName DisplayOrder="Western"><GivenName>C.</GivenName>
<FamilyName>Pandu Rangan</FamilyName>
</EditorName>
</Editor>
<Editor AffiliationIDS="Aff9"><EditorName DisplayOrder="Western"><GivenName>Bernhard</GivenName>
<FamilyName>Steffen</FamilyName>
</EditorName>
</Editor>
<Editor AffiliationIDS="Aff10"><EditorName DisplayOrder="Western"><GivenName>Madhu</GivenName>
<FamilyName>Sudan</FamilyName>
</EditorName>
</Editor>
<Editor AffiliationIDS="Aff11"><EditorName DisplayOrder="Western"><GivenName>Demetri</GivenName>
<FamilyName>Terzopoulos</FamilyName>
</EditorName>
</Editor>
<Editor AffiliationIDS="Aff12"><EditorName DisplayOrder="Western"><GivenName>Dough</GivenName>
<FamilyName>Tygar</FamilyName>
</EditorName>
</Editor>
<Editor AffiliationIDS="Aff13"><EditorName DisplayOrder="Western"><GivenName>Moshe</GivenName>
<GivenName>Y.</GivenName>
<FamilyName>Vardi</FamilyName>
</EditorName>
</Editor>
<Editor AffiliationIDS="Aff14"><EditorName DisplayOrder="Western"><GivenName>Gerhard</GivenName>
<FamilyName>Weikum</FamilyName>
</EditorName>
</Editor>
<Affiliation ID="Aff1"><OrgName>Carnegie Mellon University</OrgName>
<OrgAddress><City>Pittsburgh</City>
<State>PA</State>
<Country>USA</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff2"><OrgName>University of Surrey</OrgName>
<OrgAddress><City>Guildford</City>
<Country>UK</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff3"><OrgName>Cornell University</OrgName>
<OrgAddress><City>Ithaca</City>
<State>NY</State>
<Country>USA</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff4"><OrgName>ETH Zurich</OrgName>
<OrgAddress><Country>Switzerland</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff5"><OrgName>Stanford University</OrgName>
<OrgAddress><City>CA</City>
<Country>USA</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff6"><OrgName>Weizmann Institute of Science</OrgName>
<OrgAddress><City>Rehovot</City>
<Country>Israel</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff7"><OrgName>University of Bern</OrgName>
<OrgAddress><Country>Switzerland</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff8"><OrgName>Indian Institute of Technology</OrgName>
<OrgAddress><City>Madras</City>
<Country>India</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff9"><OrgName>University of Dortmund</OrgName>
<OrgAddress><Country>Germany</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff10"><OrgName>Massachusetts Institute of Technology</OrgName>
<OrgAddress><City>MA</City>
<Country>USA</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff11"><OrgName>New York University</OrgName>
<OrgAddress><City>NY</City>
<Country>USA</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff12"><OrgName>University of California</OrgName>
<OrgAddress><City>Berkeley</City>
<State>CA</State>
<Country>USA</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff13"><OrgName>Rice University</OrgName>
<OrgAddress><City>Houston</City>
<State>TX</State>
<Country>USA</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff14"><OrgName>Max-Planck Institute of Computer Science</OrgName>
<OrgAddress><City>Saarbruecken</City>
<Country>Germany</Country>
</OrgAddress>
</Affiliation>
</EditorGroup>
</SeriesHeader>
<SubSeries><SubSeriesInfo><SubSeriesID>1244</SubSeriesID>
<SubSeriesPrintISSN>0302-9743</SubSeriesPrintISSN>
<SubSeriesElectronicISSN>1611-3349</SubSeriesElectronicISSN>
<SubSeriesTitle Language="En">Lecture Notes in Artificial Intelligence</SubSeriesTitle>
</SubSeriesInfo>
<SubSeriesHeader><EditorGroup><Editor AffiliationIDS="Aff15"><EditorName DisplayOrder="Western"><GivenName>Jaime</GivenName>
<GivenName>G.</GivenName>
<FamilyName>Carbonell</FamilyName>
</EditorName>
</Editor>
<Editor AffiliationIDS="Aff16"><EditorName DisplayOrder="Western"><GivenName>Jörg</GivenName>
<FamilyName>Siekmann</FamilyName>
</EditorName>
</Editor>
<Affiliation ID="Aff15"><OrgName>Carnegie Mellon University</OrgName>
<OrgAddress><City>Pittsburgh</City>
<State>PA</State>
<Country>USA</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff16"><OrgName>University of Saarland</OrgName>
<OrgAddress><City>Saarbrücken</City>
<Country>Germany</Country>
</OrgAddress>
</Affiliation>
</EditorGroup>
</SubSeriesHeader>
</SubSeries>
<Book Language="En"><BookInfo BookProductType="Proceedings" ContainsESM="No" Language="En" MediaType="eBook" NumberingDepth="2" NumberingStyle="ContentOnly" OutputMedium="All" TocLevels="0"><BookID>978-3-540-25984-8</BookID>
<BookTitle>Automated Reasoning</BookTitle>
<BookSubTitle>Second International Joint Conference, IJCAR 2004, Cork, Ireland, July 4-8, 2004. Proceedings</BookSubTitle>
<BookVolumeNumber>3097</BookVolumeNumber>
<BookSequenceNumber>3097</BookSequenceNumber>
<BookDOI>10.1007/b98691</BookDOI>
<BookTitleID>83243</BookTitleID>
<BookPrintISBN>978-3-540-22345-0</BookPrintISBN>
<BookElectronicISBN>978-3-540-25984-8</BookElectronicISBN>
<BookChapterCount>36</BookChapterCount>
<BookCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName>
<CopyrightYear>2004</CopyrightYear>
</BookCopyright>
<BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject>
<BookSubject Code="I21017" Priority="1" Type="Secondary">Artificial Intelligence (incl. Robotics)</BookSubject>
<BookSubject Code="I16048" Priority="2" Type="Secondary">Mathematical Logic and Formal Languages</BookSubject>
<BookSubject Code="I1603X" Priority="3" Type="Secondary">Logics and Meanings of Programs</BookSubject>
<BookSubject Code="I14029" Priority="4" Type="Secondary">Software Engineering</BookSubject>
<SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection>
</BookSubjectGroup>
<BookContext><SeriesID>558</SeriesID>
<SubSeriesID>1244</SubSeriesID>
</BookContext>
</BookInfo>
<BookHeader><EditorGroup><Editor AffiliationIDS="Aff17"><EditorName DisplayOrder="Western"><GivenName>David</GivenName>
<FamilyName>Basin</FamilyName>
</EditorName>
<Contact><Email>basin@inf.ethz.ch</Email>
</Contact>
</Editor>
<Editor AffiliationIDS="Aff18"><EditorName DisplayOrder="Western"><GivenName>Michaël</GivenName>
<FamilyName>Rusinowitch</FamilyName>
</EditorName>
<Contact><Email>rusi@loria.fr</Email>
</Contact>
</Editor>
<Affiliation ID="Aff17"><OrgDivision>Information Security Group, Dep. of Computer Science</OrgDivision>
<OrgName>ETH</OrgName>
<OrgAddress><City>Zurich</City>
<Country>Switzerland</Country>
</OrgAddress>
</Affiliation>
<Affiliation ID="Aff18"><OrgName>LORIA & INRIA Lorraine UMR 7503</OrgName>
<OrgAddress><Country> </Country>
</OrgAddress>
</Affiliation>
</EditorGroup>
</BookHeader>
<Part ID="Part5"><PartInfo TocLevels="0"><PartID>5</PartID>
<PartSequenceNumber>5</PartSequenceNumber>
<PartTitle>Reasoning with Finite Structure</PartTitle>
<PartChapterCount>2</PartChapterCount>
<PartContext><SeriesID>558</SeriesID>
<BookTitle>Automated Reasoning</BookTitle>
</PartContext>
</PartInfo>
<Chapter ID="Chap16" Language="En"><ChapterInfo ChapterType="OriginalPaper" ContainsESM="No" NumberingDepth="2" NumberingStyle="ContentOnly" TocLevels="0"><ChapterID>16</ChapterID>
<ChapterDOI>10.1007/978-3-540-25984-8_16</ChapterDOI>
<ChapterSequenceNumber>16</ChapterSequenceNumber>
<ChapterTitle Language="En">Second-Order Logic over Finite Structures – Report on a Research Programme</ChapterTitle>
<ChapterFirstPage>229</ChapterFirstPage>
<ChapterLastPage>243</ChapterLastPage>
<ChapterCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName>
<CopyrightYear>2004</CopyrightYear>
</ChapterCopyright>
<ChapterGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant>
<AbstractGrant Grant="OpenAccess"></AbstractGrant>
<BodyPDFGrant Grant="Restricted"></BodyPDFGrant>
<BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant>
<BibliographyGrant Grant="Restricted"></BibliographyGrant>
<ESMGrant Grant="Restricted"></ESMGrant>
</ChapterGrants>
<ChapterContext><SeriesID>558</SeriesID>
<PartID>5</PartID>
<BookID>978-3-540-25984-8</BookID>
<BookTitle>Automated Reasoning</BookTitle>
</ChapterContext>
</ChapterInfo>
<ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff19"><AuthorName DisplayOrder="Western"><GivenName>Georg</GivenName>
<FamilyName>Gottlob</FamilyName>
</AuthorName>
<Contact><Email>gottlob@dbai.tuwien.ac.at</Email>
</Contact>
</Author>
<Affiliation ID="Aff19"><OrgDivision>Institut für Informationssysteme</OrgDivision>
<OrgName>Technische Universität Wien</OrgName>
<OrgAddress><Street>Favoritenstraße 9-11</Street>
<Postcode>A-1040</Postcode>
<City>Wien</City>
<Country>Austria</Country>
</OrgAddress>
</Affiliation>
</AuthorGroup>
<Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading>
<Para>This paper reports about the results achieved so far in the context of a research programme at the cutting point of logic, formal language theory, and complexity theory. The aim of this research programme is to classify the complexity of evaluating formulas from different prefix classes of second-order logic over different types of finite structures, such as strings, graphs, or arbitrary structures. In particular, we report on classifications of second-order logic on strings and of existential second-order logic on graphs.</Para>
</Abstract>
<ArticleNote Type="Misc"><SimplePara>Most of the material contained in this paper stems, modulo editorial adaptations, from the much longer papers [9, 10, 12].</SimplePara>
</ArticleNote>
</ChapterHeader>
<NoBody></NoBody>
</Chapter>
</Part>
</Book>
</Series>
</Publisher>
</istex:document>
</istex:metadataXml>
<mods version="3.6"><titleInfo lang="en"><title>Second-Order Logic over Finite Structures – Report on a Research Programme</title>
</titleInfo>
<titleInfo type="alternative" contentType="CDATA"><title>Second-Order Logic over Finite Structures – Report on a Research Programme</title>
</titleInfo>
<name type="personal"><namePart type="given">Georg</namePart>
<namePart type="family">Gottlob</namePart>
<affiliation>Institut für Informationssysteme, Technische Universität Wien, Favoritenstraße 9-11, A-1040, Wien, Austria</affiliation>
<affiliation>E-mail: gottlob@dbai.tuwien.ac.at</affiliation>
<role><roleTerm type="text">author</roleTerm>
</role>
</name>
<typeOfResource>text</typeOfResource>
<genre displayLabel="OriginalPaper" authority="ISTEX" authorityURI="https://content-type.data.istex.fr" type="conference" valueURI="https://content-type.data.istex.fr/ark:/67375/XTP-BFHXPBJJ-3">conference</genre>
<originInfo><publisher>Springer Berlin Heidelberg</publisher>
<place><placeTerm type="text">Berlin, Heidelberg</placeTerm>
</place>
<dateIssued encoding="w3cdtf">2004</dateIssued>
<copyrightDate encoding="w3cdtf">2004</copyrightDate>
</originInfo>
<language><languageTerm type="code" authority="rfc3066">en</languageTerm>
<languageTerm type="code" authority="iso639-2b">eng</languageTerm>
</language>
<abstract lang="en">Abstract: This paper reports about the results achieved so far in the context of a research programme at the cutting point of logic, formal language theory, and complexity theory. The aim of this research programme is to classify the complexity of evaluating formulas from different prefix classes of second-order logic over different types of finite structures, such as strings, graphs, or arbitrary structures. In particular, we report on classifications of second-order logic on strings and of existential second-order logic on graphs.</abstract>
<relatedItem type="host"><titleInfo><title>Automated Reasoning</title>
<subTitle>Second International Joint Conference, IJCAR 2004, Cork, Ireland, July 4-8, 2004. Proceedings</subTitle>
</titleInfo>
<name type="personal"><namePart type="given">David</namePart>
<namePart type="family">Basin</namePart>
<affiliation>Information Security Group, Dep. of Computer Science, ETH, Zurich, Switzerland</affiliation>
<affiliation>E-mail: basin@inf.ethz.ch</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Michaël</namePart>
<namePart type="family">Rusinowitch</namePart>
<affiliation>LORIA & INRIA Lorraine UMR 7503, </affiliation>
<affiliation>E-mail: rusi@loria.fr</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<genre type="book-series" authority="ISTEX" authorityURI="https://publication-type.data.istex.fr" valueURI="https://publication-type.data.istex.fr/ark:/67375/JMC-0G6R5W5T-Z">book-series</genre>
<originInfo><publisher>Springer</publisher>
<copyrightDate encoding="w3cdtf">2004</copyrightDate>
<issuance>monographic</issuance>
</originInfo>
<subject><genre>Book-Subject-Collection</genre>
<topic authority="SpringerSubjectCodes" authorityURI="SUCO11645">Computer Science</topic>
</subject>
<subject><genre>Book-Subject-Group</genre>
<topic authority="SpringerSubjectCodes" authorityURI="I">Computer Science</topic>
<topic authority="SpringerSubjectCodes" authorityURI="I21017">Artificial Intelligence (incl. Robotics)</topic>
<topic authority="SpringerSubjectCodes" authorityURI="I16048">Mathematical Logic and Formal Languages</topic>
<topic authority="SpringerSubjectCodes" authorityURI="I1603X">Logics and Meanings of Programs</topic>
<topic authority="SpringerSubjectCodes" authorityURI="I14029">Software Engineering</topic>
</subject>
<identifier type="DOI">10.1007/b98691</identifier>
<identifier type="ISBN">978-3-540-22345-0</identifier>
<identifier type="eISBN">978-3-540-25984-8</identifier>
<identifier type="ISSN">0302-9743</identifier>
<identifier type="eISSN">1611-3349</identifier>
<identifier type="BookTitleID">83243</identifier>
<identifier type="BookID">978-3-540-25984-8</identifier>
<identifier type="BookChapterCount">36</identifier>
<identifier type="BookVolumeNumber">3097</identifier>
<identifier type="BookSequenceNumber">3097</identifier>
<identifier type="PartChapterCount">2</identifier>
<part><date>2004</date>
<detail type="part"><title>Reasoning with Finite Structure</title>
</detail>
<detail type="volume"><number>3097</number>
<caption>vol.</caption>
</detail>
<extent unit="pages"><start>229</start>
<end>243</end>
</extent>
</part>
<recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2004</recordOrigin>
</recordInfo>
</relatedItem>
<relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title>
</titleInfo>
<name type="personal"><namePart type="given">Takeo</namePart>
<namePart type="family">Kanade</namePart>
<affiliation>Carnegie Mellon University, Pittsburgh, PA, USA</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Josef</namePart>
<namePart type="family">Kittler</namePart>
<affiliation>University of Surrey, Guildford, UK</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Jon</namePart>
<namePart type="given">M.</namePart>
<namePart type="family">Kleinberg</namePart>
<affiliation>Cornell University, Ithaca, NY, USA</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Friedemann</namePart>
<namePart type="family">Mattern</namePart>
<affiliation>ETH Zurich, Switzerland</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">John</namePart>
<namePart type="given">C.</namePart>
<namePart type="family">Mitchell</namePart>
<affiliation>Stanford University, CA, USA</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Moni</namePart>
<namePart type="family">Naor</namePart>
<affiliation>Weizmann Institute of Science, Rehovot, Israel</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Oscar</namePart>
<namePart type="family">Nierstrasz</namePart>
<affiliation>University of Bern, Switzerland</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">C.</namePart>
<namePart type="family">Pandu Rangan</namePart>
<affiliation>Indian Institute of Technology, Madras, India</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Bernhard</namePart>
<namePart type="family">Steffen</namePart>
<affiliation>University of Dortmund, Germany</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Madhu</namePart>
<namePart type="family">Sudan</namePart>
<affiliation>Massachusetts Institute of Technology, MA, USA</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Demetri</namePart>
<namePart type="family">Terzopoulos</namePart>
<affiliation>New York University, NY, USA</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Dough</namePart>
<namePart type="family">Tygar</namePart>
<affiliation>University of California, Berkeley, CA, USA</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Moshe</namePart>
<namePart type="given">Y.</namePart>
<namePart type="family">Vardi</namePart>
<affiliation>Rice University, Houston, TX, USA</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Gerhard</namePart>
<namePart type="family">Weikum</namePart>
<affiliation>Max-Planck Institute of Computer Science, Saarbruecken, Germany</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<originInfo><publisher>Springer</publisher>
<copyrightDate encoding="w3cdtf">2004</copyrightDate>
<issuance>serial</issuance>
</originInfo>
<relatedItem type="constituent"><titleInfo><title>Lecture Notes in Artificial Intelligence</title>
</titleInfo>
<name type="personal"><namePart type="given">Takeo</namePart>
<namePart type="family">Kanade</namePart>
<affiliation>Carnegie Mellon University, Pittsburgh, PA, USA</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Josef</namePart>
<namePart type="family">Kittler</namePart>
<affiliation>University of Surrey, Guildford, UK</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Jon</namePart>
<namePart type="given">M.</namePart>
<namePart type="family">Kleinberg</namePart>
<affiliation>Cornell University, Ithaca, NY, USA</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Friedemann</namePart>
<namePart type="family">Mattern</namePart>
<affiliation>ETH Zurich, Switzerland</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">John</namePart>
<namePart type="given">C.</namePart>
<namePart type="family">Mitchell</namePart>
<affiliation>Stanford University, CA, USA</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Moni</namePart>
<namePart type="family">Naor</namePart>
<affiliation>Weizmann Institute of Science, Rehovot, Israel</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Oscar</namePart>
<namePart type="family">Nierstrasz</namePart>
<affiliation>University of Bern, Switzerland</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">C.</namePart>
<namePart type="family">Pandu Rangan</namePart>
<affiliation>Indian Institute of Technology, Madras, India</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Bernhard</namePart>
<namePart type="family">Steffen</namePart>
<affiliation>University of Dortmund, Germany</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Madhu</namePart>
<namePart type="family">Sudan</namePart>
<affiliation>Massachusetts Institute of Technology, MA, USA</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Demetri</namePart>
<namePart type="family">Terzopoulos</namePart>
<affiliation>New York University, NY, USA</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Dough</namePart>
<namePart type="family">Tygar</namePart>
<affiliation>University of California, Berkeley, CA, USA</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Moshe</namePart>
<namePart type="given">Y.</namePart>
<namePart type="family">Vardi</namePart>
<affiliation>Rice University, Houston, TX, USA</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Gerhard</namePart>
<namePart type="family">Weikum</namePart>
<affiliation>Max-Planck Institute of Computer Science, Saarbruecken, Germany</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Jaime</namePart>
<namePart type="given">G.</namePart>
<namePart type="family">Carbonell</namePart>
<affiliation>Carnegie Mellon University, Pittsburgh, PA, USA</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Jörg</namePart>
<namePart type="family">Siekmann</namePart>
<affiliation>University of Saarland, Saarbrücken, Germany</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">David</namePart>
<namePart type="family">Basin</namePart>
<affiliation>Information Security Group, Dep. of Computer Science, ETH, Zurich, Switzerland</affiliation>
<affiliation>E-mail: basin@inf.ethz.ch</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<name type="personal"><namePart type="given">Michaël</namePart>
<namePart type="family">Rusinowitch</namePart>
<affiliation>LORIA & INRIA Lorraine UMR 7503, </affiliation>
<affiliation>E-mail: rusi@loria.fr</affiliation>
<role><roleTerm type="text">editor</roleTerm>
</role>
</name>
<genre type="sub-series"></genre>
<identifier type="ISSN">0302-9743</identifier>
<identifier type="eISSN">1611-3349</identifier>
<identifier type="SubSeriesID">1244</identifier>
</relatedItem>
<identifier type="ISSN">0302-9743</identifier>
<identifier type="eISSN">1611-3349</identifier>
<identifier type="SeriesID">558</identifier>
<recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2004</recordOrigin>
</recordInfo>
</relatedItem>
<identifier type="istex">959C346C4BEC0856416C1648C45906C5377CB885</identifier>
<identifier type="ark">ark:/67375/HCB-076LZMFH-M</identifier>
<identifier type="DOI">10.1007/978-3-540-25984-8_16</identifier>
<identifier type="ChapterID">16</identifier>
<identifier type="ChapterID">Chap16</identifier>
<accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag Berlin Heidelberg, 2004</accessCondition>
<recordInfo><recordContentSource authority="ISTEX" authorityURI="https://loaded-corpus.data.istex.fr" valueURI="https://loaded-corpus.data.istex.fr/ark:/67375/XBH-RLRX46XW-4">springer</recordContentSource>
<recordOrigin>Springer-Verlag Berlin Heidelberg, 2004</recordOrigin>
</recordInfo>
</mods>
<json:item><extension>json</extension>
<original>false</original>
<mimetype>application/json</mimetype>
<uri>https://api.istex.fr/ark:/67375/HCB-076LZMFH-M/record.json</uri>
</json:item>
</metadata>
</istex>
</record>
Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 002299 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 002299 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien |wiki= Wicri/Lorraine |area= InforLorV4 |flux= Istex |étape= Corpus |type= RBID |clé= ISTEX:959C346C4BEC0856416C1648C45906C5377CB885 |texte= Second-Order Logic over Finite Structures – Report on a Research Programme }}
![]() | This area was generated with Dilib version V0.6.33. | ![]() |