Matches in SemOpenAlex for { <https://semopenalex.org/work/W1766867734> ?p ?o ?g. }
Showing items 1 to 77 of
77
with 100 items per page.
- W1766867734 abstract "Invited Papers.- Background, Reserve, and Gandy Machines.- Choiceless Polynomial Time Computation and the Zero-One Law.- Composition and Submachine Concepts for Sequential ASMs.- Une tentative malheureuse de construire une structure eliminant rapidement les quanteurs.- Translating Theory into Practice - Abstract State Machines within Microsoft.- Choiceless Polynomial Time Logic: Inability to Express.- Schema Revisited.- Automated Verification = Graphs, Automata, and Logic.- Contributed Papers.- A Fully Complete PER Model for ML Polymorphic Types.- Subtyping with Power Types.- The Descriptive Complexity of the Fixed-Points of Bounded Formulas.- Hypersequents and the Proof Theory of Intuitionistic Fuzzy Logic.- Continuous Functionals of Dependent Types and Equilogical Spaces.- Definability over Linear Constraints.- Bounded Arithmetic and Descriptive Complexity.- Independence: Logics and Concurrency.- Flatness Is Not a Weakness.- Sequents, Frames, and Completeness.- Disjunctive Tautologies as Synchronisation Schemes.- Axiomatizing the Least Fixed Point Operation and Binary Supremum.- Interactive Programs in Dependent Type Theory.- Modal Satisfiability Is in Deterministic Linear Space.- Logic Programming and Co-inductive Definitions.- A Theory of Explicit Mathematics Equivalent to ID 1.- On the Complexity of Explicit Modal Logics.- Finite Models and Full Completeness.- On the Complexity of Combinatorial and Metafinite Generating Functions of Graph Properties in the Computational Model of Blum, Shub and Smale.- Elimination of Negation in a Logical Framework.- Discreet Games, Light Affine Logic and PTIME Computation.- Completeness of Higher-Order Duration Calculus.- Equational Termination by Semantic Labelling.- On the Computational Interpretation of Negation.- From Programs to Games: Invariance and Safety for Bisimulation.- Logical Relations and Data Abstraction.- Elementary Choiceless Constructive Analysis.- On the Logic of the Standard Proof Predicate." @default.
- W1766867734 created "2016-06-24" @default.
- W1766867734 creator A5038186958 @default.
- W1766867734 creator A5071784825 @default.
- W1766867734 date "2000-09-15" @default.
- W1766867734 modified "2023-09-26" @default.
- W1766867734 title "Computer Science Logic: 14th International Workshop, CSL 2000 Annual Conference of the EACSL Fischbachau, Germany, August 21-26, 2000 Proceedings" @default.
- W1766867734 hasPublicationYear "2000" @default.
- W1766867734 type Work @default.
- W1766867734 sameAs 1766867734 @default.
- W1766867734 citedByCount "0" @default.
- W1766867734 crossrefType "book" @default.
- W1766867734 hasAuthorship W1766867734A5038186958 @default.
- W1766867734 hasAuthorship W1766867734A5071784825 @default.
- W1766867734 hasConcept C108710211 @default.
- W1766867734 hasConcept C118615104 @default.
- W1766867734 hasConcept C133142742 @default.
- W1766867734 hasConcept C135315306 @default.
- W1766867734 hasConcept C136119220 @default.
- W1766867734 hasConcept C178421362 @default.
- W1766867734 hasConcept C18903297 @default.
- W1766867734 hasConcept C202444582 @default.
- W1766867734 hasConcept C2318724 @default.
- W1766867734 hasConcept C2524010 @default.
- W1766867734 hasConcept C2777299769 @default.
- W1766867734 hasConcept C28077239 @default.
- W1766867734 hasConcept C311688 @default.
- W1766867734 hasConcept C33923547 @default.
- W1766867734 hasConcept C41008148 @default.
- W1766867734 hasConcept C80444323 @default.
- W1766867734 hasConcept C86803240 @default.
- W1766867734 hasConcept C93682546 @default.
- W1766867734 hasConceptScore W1766867734C108710211 @default.
- W1766867734 hasConceptScore W1766867734C118615104 @default.
- W1766867734 hasConceptScore W1766867734C133142742 @default.
- W1766867734 hasConceptScore W1766867734C135315306 @default.
- W1766867734 hasConceptScore W1766867734C136119220 @default.
- W1766867734 hasConceptScore W1766867734C178421362 @default.
- W1766867734 hasConceptScore W1766867734C18903297 @default.
- W1766867734 hasConceptScore W1766867734C202444582 @default.
- W1766867734 hasConceptScore W1766867734C2318724 @default.
- W1766867734 hasConceptScore W1766867734C2524010 @default.
- W1766867734 hasConceptScore W1766867734C2777299769 @default.
- W1766867734 hasConceptScore W1766867734C28077239 @default.
- W1766867734 hasConceptScore W1766867734C311688 @default.
- W1766867734 hasConceptScore W1766867734C33923547 @default.
- W1766867734 hasConceptScore W1766867734C41008148 @default.
- W1766867734 hasConceptScore W1766867734C80444323 @default.
- W1766867734 hasConceptScore W1766867734C86803240 @default.
- W1766867734 hasConceptScore W1766867734C93682546 @default.
- W1766867734 hasLocation W17668677341 @default.
- W1766867734 hasOpenAccess W1766867734 @default.
- W1766867734 hasPrimaryLocation W17668677341 @default.
- W1766867734 hasRelatedWork W122683104 @default.
- W1766867734 hasRelatedWork W1533216727 @default.
- W1766867734 hasRelatedWork W1536132061 @default.
- W1766867734 hasRelatedWork W1552653022 @default.
- W1766867734 hasRelatedWork W1563057666 @default.
- W1766867734 hasRelatedWork W1595031677 @default.
- W1766867734 hasRelatedWork W1606528032 @default.
- W1766867734 hasRelatedWork W1835518415 @default.
- W1766867734 hasRelatedWork W2022963984 @default.
- W1766867734 hasRelatedWork W2033977824 @default.
- W1766867734 hasRelatedWork W2072873942 @default.
- W1766867734 hasRelatedWork W2075692041 @default.
- W1766867734 hasRelatedWork W2278496466 @default.
- W1766867734 hasRelatedWork W2570945757 @default.
- W1766867734 hasRelatedWork W2895078906 @default.
- W1766867734 hasRelatedWork W2896709287 @default.
- W1766867734 hasRelatedWork W2951101271 @default.
- W1766867734 hasRelatedWork W2998098850 @default.
- W1766867734 hasRelatedWork W86787093 @default.
- W1766867734 hasRelatedWork W1886429788 @default.
- W1766867734 isParatext "false" @default.
- W1766867734 isRetracted "false" @default.
- W1766867734 magId "1766867734" @default.
- W1766867734 workType "book" @default.