<--- Back to Details
First PageDocument Content
Model theory / Metalogic / Predicate logic / Electronic design automation / Linear temporal logic / First-order logic / Boolean satisfiability problem / Well-formed formula / Constructible universe / Logic / Mathematical logic / Theoretical computer science
Date: 1997-06-05 08:58:45
Model theory
Metalogic
Predicate logic
Electronic design automation
Linear temporal logic
First-order logic
Boolean satisfiability problem
Well-formed formula
Constructible universe
Logic
Mathematical logic
Theoretical computer science

BRICS Basic Research in Computer Science BRICS RS-97-5 Etessami et al.: First-Order Logic with Two Variables and Unary Temporal Logic First-Order Logic with

Add to Reading List

Source URL: www.brics.dk

Download Document from Source Website

File Size: 142,67 KB

Share Document on Facebook

Similar Documents

Predicate Abstraction for Programmable Logic Controllers Sebastian Biallas, Mirco Giacobbe and Stefan Kowalewski Embedded Software Laboratory, RWTH Aachen University, Germany  Abstract. In this paper, we present a predic

Predicate Abstraction for Programmable Logic Controllers Sebastian Biallas, Mirco Giacobbe and Stefan Kowalewski Embedded Software Laboratory, RWTH Aachen University, Germany Abstract. In this paper, we present a predic

DocID: 1xUQe - View Document

J. Korean Math. Soc.  FORMALIZING THE META-THEORY OF FIRST-ORDER PREDICATE LOGIC Hugo Herberlin, SunYoung Kim, and Gyesik Lee Abstract. This paper introduces a representation style of variable binding using dependent typ

J. Korean Math. Soc. FORMALIZING THE META-THEORY OF FIRST-ORDER PREDICATE LOGIC Hugo Herberlin, SunYoung Kim, and Gyesik Lee Abstract. This paper introduces a representation style of variable binding using dependent typ

DocID: 1v7hr - View Document

STRICT PREDICATIVITY1 Charles Parsons The most basic notion of impredicativity applies to specifications or definitions of sets or classes. If a set b is specified as {x: A(x)} for some predicate A, then the specificatio

STRICT PREDICATIVITY1 Charles Parsons The most basic notion of impredicativity applies to specifications or definitions of sets or classes. If a set b is specified as {x: A(x)} for some predicate A, then the specificatio

DocID: 1unjy - View Document

Automata Theory Approach to Predicate Intuitionistic Logic Maciej Zielenkiewicz and Aleksy Schubert Institute of Informatics, University of Warsaw, Warsaw, Poland [maciekz,alx]@mimuw.edu.pl 1. Arcadian Automata

Automata Theory Approach to Predicate Intuitionistic Logic Maciej Zielenkiewicz and Aleksy Schubert Institute of Informatics, University of Warsaw, Warsaw, Poland [maciekz,alx]@mimuw.edu.pl 1. Arcadian Automata

DocID: 1tDnH - View Document

Predicate Abstraction in a Program Logic Calculus Benjamin Weiß Institute for Theoretical Computer Science University of Karlsruhe, DKarlsruhe, Germany

Predicate Abstraction in a Program Logic Calculus Benjamin Weiß Institute for Theoretical Computer Science University of Karlsruhe, DKarlsruhe, Germany

DocID: 1sZ2t - View Document