c Cambridge University Press 2009 JFP: page 1 of 24.  1 doi:S0956796809990219

Source URL: www.cs.ioc.ee

• Logic in computer science
• Programming language semantics
• Models of computation
• Computability theory
• Logic programming
• Substitution
• Operational semantics
• Denotational semantics
• Lambda calculus
• Structure

Denotational semantics for lazy initialization of letrec black holes as exceptions rather than divergence Keiko Nakata Institute of Cybernetics at Tallinn University of Technology Abstract We present a denotational seman

Source URL: www.cs.ioc.ee

• Theoretical computer science
• Models of computation
• Mathematical logic
• Software engineering
• Computability theory
• Denotational semantics
• Logic in computer science
• Lambda calculus
• Substitution
• Function type

LNAIStrongly Complete Axiomatizations of “Knowing at Most” in Syntactic Structures

Source URL: folk.uib.no

• Model theory
• Interpretation
• Substitution
• Compactness theorem
• Linear temporal logic
• Differential forms on a Riemann surface

The Costs and Benefits of Leaving the EU: Trade Effects Swati Dhingra Hanwei Huang Gianmarco Ottaviano

Source URL: cep.lse.ac.uk

• Mathematical economics
• Consumer theory
• Elasticity
• Elasticity of substitution
• Brexit
• Elasticity of a function

Towards a Proof Theory for Multi-Agent Logics with Irrevocable Strategies 1 ˚ Thomas Agotnes , Valentin Goranko2 , and Wojciech Jamroga3

Source URL: folk.uib.no

• Logic
• Mathematical logic
• Philosophy
• Model theory
• Formal languages
• Logical truth
• Propositional calculus
• Linear temporal logic
• Temporal logic
• Interpretation
• Substitution
• operator

REFERENTIAL SEMANTICS : DUALITY AND APPLICATIONS RAMON JANSANA, ALESSANDRA PALMIGIANO UNIVERSITAT DE BARCELONA 1. Introduction Substitution-invariant consequence relations between sets of formulas and formulas

Source URL: www.appliedlogictudelft.nl

Knowing Minimum/Maximum n Formulae 1 and Natasha Alechina 2 ˚ Thomas Agotnes Abstract. We introduce a logical language with nullary operators min(n), for each non-negative integer n, which mean ‘the reasoner has at l

Source URL: folk.uib.no

• Logic
• Mathematical logic
• Abstraction
• Model theory
• Formal languages
• Logical truth
• Metalogic
• First-order logic
• Interpretation
• Substitution
• Well-formed formula
• Satisfiability

Ambivalent Types for Principal Type Inference with GADTs Jacques Garrigue1 and Didier R´emy2 1 Nagoya University, Graduate School of Mathematics

Source URL: www.math.nagoya-u.ac.jp

• Logic
• Automated theorem proving
• Logic programming
• Logical truth
• Propositional calculus
• Substitution
• Orbifold
• Symbol

Course Substitution Petition

Source URL: www.engr.utk.edu

Completeness and Decidability of de Bruijn Substitution Algebra in Coq Steven Sch¨afer Gert Smolka

Source URL: www.ps.uni-saarland.de