Solving Exists/Forall Problems With Yices Extended Abstract Bruno Dutertre Computer Science Laboratory SRI International

Source URL: yices.csl.sri.com

• Model theory
• Logic in computer science
• Semantics
• Formal languages
• Logical truth
• Satisfiability modulo theories
• Interpretation
• Quantifier elimination
• True quantified Boolean formula
• Quantifier
• Substitution
• Well-formed formula

N. Kobayashi and B. C. Pierce (Eds): Fourth International Symposium on Theoretical Aspects of Computer Software (TACS2001), LNCS Vol. 2215, pp. 219–242, 2001. c Springer-Verlag Berlin Heidelberg 2001 Nominal Logic:

Source URL: www.cl.cam.ac.uk

• Model theory
• Automated theorem proving
• Logic programming
• First-order logic
• Predicate logic
• Symbol
• Substitution
• Constructible universe
• Interpretation

SOLUTES DE SUBSTITUTION au décours d’un ECHANGE PLASMATIQUE Dr S. SAHEB Centre Clinique d’Hémobiothérapie

Source URL: www.hemapherese.fr

Low-level dichotomy for Quantified Constraint Satisfaction Problems Barnaby Martin 1 School of Engineering and Computing Sciences, Durham University, Science Labs, South Road, Durham DH1 3LE, U.K.

Source URL: www.bedewell.com

• Model theory
• Constraint programming
• Logical truth
• Mathematical logic
• Formal languages
• Structure
• Interpretation
• Satisfiability
• Substitution
• Constraint satisfaction problem
• Complexity of constraint satisfaction
• Boolean satisfiability problem

Estimating a High-Frequency NewKeynesian Phillips Curve by Steffen Ahrens and Stephen Sacht No. 1686 | November 2012 Kiel Institute for the World Economy, Hindenburgufer 66, 24105 Kiel, Germany

Source URL: www.macroeconomics.tu-berlin.de

• Estimation theory
• New Keynesian economics
• Nominal rigidity
• Phillips curve
• Generalized method of moments
• Real versus nominal value
• Macroeconomics
• Monetary policy
• Inflation
• Consumer price index
• Economics
• Substitution

Appendix to Chen et al., ICFPAppendix to Chen et al., Implicit self-adjusting computation for purely functional programs (ICFPIn Section A, we show that translation maps source types to corresponding target

Source URL: www.mpi-sws.org

• Automated theorem proving
• Logic programming
• Logical truth
• Propositional calculus
• Substitution
• Computability theory
• Table of stars with Bayer designations
• Symbol

STABLE CANONICAL RULES GURAM BEZHANISHVILI, NICK BEZHANISHVILI, ROSALIE IEMHOFF Abstract. We introduce stable canonical rules and prove that each normal modal rule system is axiomatizable by stable canonical rules. This

Source URL: www.phil.uu.nl

• Modal logic
• Non-classical logic
• Model theory
• Boolean algebra
• Philosophical logic
• Kripke semantics
• Interior algebra
• Heyting algebra
• Embedding
• Intermediate logic
• Normal modal logic
• Substitution

UNIVERSITY OF CALIFORNIA, LOS ANGELES DEPARTMENT OF PHILOSOPHY Course Substitution Petition Petition Use A Course Substitution Petition may be used to

Source URL: philosophy.ucla.edu

• Belief
• Humanities
• Philosophy
• Thought
• Massachusetts Institute of Technology

Superficially Substructural Types (Technical Appendix) Neelakantan R. Krishnaswami MPI-SWS

Source URL: www.mpi-sws.org

• Automated theorem proving
• Logic programming
• Logical truth
• Propositional calculus
• Substitution
• Differential topology
• Symbol
• Table of stars with Bayer designations

Modular Bisimulation Theory for Computations and Values Martin Churchill and Peter D. Mosses {m.d.churchill,p.d.mosses}@swansea.ac.uk Department of Computer Science, Swansea University, Swansea, UK

Source URL: plancomps.dreamhosters.com

• Logic in computer science
• Theoretical computer science
• Automated theorem proving
• Logic programming
• Bisimulation
• Substitution
• Operational semantics
• Transition system
• Derivative
• Permutation
• Variable
• -calculus