<--- Back to Details
First PageDocument Content
Logic / Mathematical logic / Mathematics / Boolean algebra / Complexity classes / Metalogic / Model theory / True quantified Boolean formula / Satisfiability / FO / PSPACE-complete / Well-formed formula
Date: 2010-06-02 16:25:19
Logic
Mathematical logic
Mathematics
Boolean algebra
Complexity classes
Metalogic
Model theory
True quantified Boolean formula
Satisfiability
FO
PSPACE-complete
Well-formed formula

Introduction Background, Theory Validating Squolem’s Certificates in HOL4 Evaluation Conclusions

Add to Reading List

Source URL: user.it.uu.se

Download Document from Source Website

File Size: 1,04 MB

Share Document on Facebook

Similar Documents

Logic / Non-classical logic / Mathematical logic / Metaphysics / Philosophical logic / Artificial intelligence / Description logic / Information science / Model theory / Modal logic / First-order logic / Web Ontology Language

Description Logics ILCS 2007 Introduction to Logic in Computer Science: Autumn 2007

DocID: 1xVOl - View Document

Software engineering / Computer programming / Computing / Computational neuroscience / Object-oriented programming languages / Cross-platform software / Software testing / Program analysis / Software bug / Type system / Artificial neural network / Fuzzing

MLP on Wednesday, July 18th https://easychair.org/smart-program/FLoC2018... FLOC 2018: FEDERATED LOGIC CONFERENCE 2018

DocID: 1xVNY - View Document

Computing / Network protocols / Information and communications technology / Internet of things / Web of Things / World Wide Web / Computer network / USB / Protocol stack / Internet protocol suite

2016 Real Time Logic LLC Copyright 2016 INTRODUCTION

DocID: 1xVN8 - View Document

Formal methods / Logic in computer science / Temporal logic / Runtime verification

Towards a Logic for Inferring Properties of Event Streams? Sean Kauffman1 , Rajeev Joshi2 , and Klaus Havelund2 1 2

DocID: 1xVDG - View Document

Mathematics / Theoretical computer science / Algebra / Linear programming / Formal methods / Constraint programming / Declarative programming / Invariant / Satisfiability modulo theories / Linear inequality / Inequality

Speeding Up the Constraint-Based Method in Difference Logic ⋆ Lorenzo Candeago1, Daniel Larraz2, Albert Oliveras2, Enric Rodr´ıguez-Carbonell2, and Albert Rubio2 2

DocID: 1xVBD - View Document