{"@context":["https://w3id.org/fdo/context/v1",{"schema":"https://schema.org/","prov":"http://www.w3.org/ns/prov#","fdo":"https://w3id.org/fdo/vocabulary/"}],"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q5310652","@type":"DigitalObject","kernel":{"@id":"https://fdo.portal.mardi4nfdi.de/fdo/Q5310652","digitalObjectType":"https://schema.org/ScholarlyArticle","primaryIdentifier":"mardi:Q5310652","kernelVersion":"v1","immutable":true,"modified":"2026-01-13T10:29:17Z"},"profile":{"@context":"https://schema.org","@type":"ScholarlyArticle","@id":"https://portal.mardi4nfdi.de/entity/Q5310652","name":"Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA","headline":"Algorithmic correspondence and completeness in modal logic. I. The core algorithm SQEMA","description":"scientific article; zbMATH DE number 5200122","url":"https://portal.mardi4nfdi.de/entity/Q5310652","datePublished":"2007-10-11","author":[{"@id":"https://portal.mardi4nfdi.de/entity/Q409327"},{"@id":"https://portal.mardi4nfdi.de/entity/Q703859"},{"@id":"https://portal.mardi4nfdi.de/entity/Q454384"}],"publisher":[{"@id":"https://portal.mardi4nfdi.de/entity/Q2786118"}],"identifier":{"@type":"PropertyValue","propertyID":"doi","value":"10.2168/LMCS-2(1:5)2006","url":"https://doi.org/10.2168/LMCS-2(1:5)2006"},"sameAs":["https://doi.org/10.2168/LMCS-2(1:5)2006"]},"provenance":{"prov:generatedAtTime":"2026-01-13T10:29:17Z","prov:wasAttributedTo":"MaRDI Knowledge Graph"}}