41.
Calendar Logic
- Hans Jürgen Ohlbach; Dov Gabbay
A propositional temporal logic is introduced whose operators quantify over intervals of a reference time line. The intervals are specified symbolically, for example `next week's weekend'. The specification language for the intervals takes into account all the features of real calendar systems. A simple statement which can be expressed in this language is for example: `yesterday I worked for eight hours with one hour lunch break at noon'. Calendar Logic can be translated into propositional logic. Satisfiability is therefore decidable. Since the translation is exponential, a tableau decision procedure for checking decidability is presented as an alternative.
42.
Calendar logic
- Hans Jürgen Ohlbach; Dov Gabbay
ABSTRACT. A propositional temporal logic is introduced whose operators quantify over intervals of a reference time line. The intervals are specified symbolically, for example ‘next week’s weekend’. The specification language for the intervals takes into account all the features of real calendar systems. A simple statement which can be expressed in this language is for example: ‘yesterday I worked for eight hours with one hour lunch break at noon’. Calendar Logic can be translated into propositional logic. Satisfiability is therefore decidable. Since the translation is exponential, a tableau decision procedure for checking decidability is presented as an alternative.
43.
Lógica
- Academia de Ciencias de la U.R.S.S.
44.
Logica.
- Castrovol, Pedro de; Castrovol, Pedro de
Referencias: R.
45.
Logic,
- Sigwart, Christoph, 1830-1904.
2d ed.
46.
Logic,
- Jevons, William Stanley, 1835-1882.
1 p.l., [v]-vi, [7]-135, [1] p.
47.
Una o varias lógicas?
- Palau, Gladys Dora
48.
Logic.
- Whately, Richard, 1787-1863.
xvi, 112 p.
49.
Logic;
- Smith, George H. (George Hugh)
xiii, 266 p.
50.
Temporal Logic,
Introduction ---
Notes for the Sixth European Summer School
in Logic, Language, and Information,
Copenhagen 1994
Mads Dam
Swedish Institute of Computer Science
1 Introduction and Overview
The area of intersection between temporal logic, automata on finite and infinite
objects, and classical first- or restricted second-order logics is one of considerable
richness. All these areas have long and venerable traditions in mathematics, logic,
and theoretical computer science, and their intimate relationships have been realised
for quite some time. Indeed, automata of infinite objects were invented
for the purpose of just answering decidability issues in classical first- or restricted
second-order logics. However, the area has remained open to new points-of-view
and insights, and very fundamental...
51.
Contrastive Logic
In this paper I introduce the notion of bilogics, namely logics interpreted over a pair of structures, in
contrast to classical logic and many of its variations, the formulae of which are interpreted over one
structure. In particular, I introduce and study Contrastive Logic, suitable for expressing contrast
and conformity between the two structures involved.
A major reason for this study is striving towards an extension of truth-conditional semantics to
cover several natural-language particles, which have been hitherto considered not to be amenable
to such an extensional treatment, and were delegated to the level of non-extensional pragmatics.
Examples of such particles are but and already.
Keywords: contrastive logic,...
52.
Computational Logic
tresses complexity issues, and how proofs can be analyzed to produce computational
information, proving a version of the famous Dialectica" theorem of Godel. The course concludes with
a discussion of linear logic, a so-called resource-conscious logic; we will discuss the relationship between
cut-elimination (proof simplication) in linear logic, and evaluation of programs written in -calculus.
Required work: Work for the course will include several problem sets, and some class presentations.
Even though I love grading problem sets, I'm going to try to have it done by you on a round-robin basis.
Items marked ? in the syllabus are lectures where you may volunteer to do the...
53.
Contrastive Logic
- Nissim Francez Computer
In this paper I introduce the notion of bilogics, namely logics interpreted over a pair of structures, in contrast to classical logic and many of its variations, the formulae of which are interpreted over one structure. In particular, I introduce and study Contrastive Logic, suitable for expressing contrast and conformity between the two structures involved. A major reason for this study is striving towards an extension of truth-conditional semantics to cover several natural-language particles, which have been hitherto considered not to be amenable to such an extensional treatment, and were delegated to the level of non-extensional pragmatics. Examples of such...
54.
Trakhtenbrot Theorem and Fuzzy Logic
- Petr Hajek; Fuzzy Logic
Trakhtenbrot theorem is shown to be valid for the three main fuzzy logics - Lukasiewicz, Gödel and product logic.
55.
Ejercicio sobre lógica booleana
- Saiz Noeda, Maximiliano
Ejercicio para practicar los conceptos de lógica (Tema 2: Conceptos
Genéricos).
56.
Ejercicio sobre lógica booleana
- Saiz Noeda, Maximiliano
Ejercicio para practicar los conceptos de lógica (Tema 2: Conceptos
Genéricos).
57.
A Theory of Logic Programming
- Carlos Viegas Damásio; Luís Moniz Pereira
In this paper we define the rather general framework of Monotonic Logic Programs, where the main results of (definite) logic programming are validly extrapolated. Whenever defining new logic programming extensions, we can thus turn our attention to the stipulation and study of its intuitive algebraic properties within the very general setting. Then, the existence of a minimum model and of a monotonic immediate consequences operator is guaranteed, and they are related as in classical logic programming. Our framework captures several quite distinct logic programming semantics, namely Generalized Annotated Logic Programs, Fuzzy Logic Programming, Hybrid Probabilistic Logic Programs, and Possibilistic Logic...
58.
From Indexed Lax Logic to Intuitionistic Logic
- Deepak Garg; Michael Carl Tschantz
We present translations from a logic with indexed lax modalities to first-order intuitionistic logic and intuitionistic linear logic. These translations rely on a continuation passing style encoding for the lax modalities. We show that our translations preserve provability of formulas. 1 This author was partially sponsored by the Air Force Research Laboratory under grant no. FA87500720028.
59.
Linear Logic
- Patrick Lincoln
this paper we will restrict attention to propositional linear logic.
60.
Linear Logic
- Patrick Lincoln
this paper we will restrict attention to propositional linear logic
