Logic — math, philosophy & computational aspects

Archive for December, 2009

application of circumscription other than to ab(x)

I am interested in tracking down any paper documenting the application of
circumscription (cf. McCarthy, Lifschitz) to

1. applications other than the minimisation of ab predicates ?  In
        this class, I do not include papers showing the relationship
        between circumscription and, for example, logic programs but
        do include applications such as formalising configuration
        tasks (which typically minimise the sets of components being
        assembled in a configuration).

2. actual applications of circumscription to diagnosis,
        showing practical application in some domain ? While
        Reiter’s work on diagnosis from 1st principles certainly
        recognises the relationship between diagnoses being minimal
        sets of abnormalities, I am not aware of any papers that
        document the application of a circumscription policy to a
        set of formulae and subsequent computation of the diagnoses.

As 1. suggests, I am considering the feasability of describing a class of
configuration problems in terms of circumscription policies applied to a
first order theory and am interested in whether any work has been done in
applying circumscription in domains other than directly to default
reasoning.  Applying circumscription policies provides a conceptually nice
way of stating predicate minimisation (such as that a minimum number of
components satisfying the constraints of a design problem is often a
desirable configuration).  Obviously, the irreducability to first-order of
general first-order theories is of some concern but potentially controlled
if the class of admissable formulae are suitably constrained.

sincerely,

Nirad.

Nirad Sharma
Computer Science, University of Queensland. 4072.  Australia

how to grill from the best .
posted by admin in Uncategorized and have No Comments

Loeb repost?

A while ago there was a post about using Loeb’s theorem as an
alternative to Goedel’s theorem in arguments about mechanism;
could someone mail it to me?

Thanks in advance,

damjan.bojadz…@ijs.si
http://nl.ijs.si/~damjan/me.html

posted by admin in Uncategorized and have Comments (9)

CADE-13 Second Call for Papers (text & LaTeX)

     The Thirteenth International Conference on Automated Deduction
     ————————————————————–

                            Rutgers University
                      New Brunswick, New Jersey, USA

                         30 July – 3 August, 1996

                     CADE-13:  Second Call for Papers

The CADE conferences are the major forum for the presentation of new
research in all aspects of automated deduction. Original research
papers, descriptions of working reasoning systems, and problem sets
that provide innovative, challenging tests for automated reasoning
systems, are solicited.

CADE conferences cover all aspects of automated deduction:

  First vs. Higher Order Logics          Classical vs. Non-Classical Logics
  Special vs. General Purpose Inference  Interactive vs. Automatic Systems

Specific topics of interest include (but are not limited to):

    Resolution          Sequent Calculus        Decision Procedures
    Unification         Rewrite Rules           Mathematical Induction

and any applications of automated deduction, including:

    Deductive Databases         Logic and Functional Programming
    Commonsense Reasoning       Software and Hardware Development
    Distributed Theorem Proving Learning Search Heuristics

******************************************************************
** Papers on commercial or industrial applications of automated **
** deduction are especially encouraged.                         **
******************************************************************

CADE-13 will be held as part of the Federated Logic Conference (FLoC’96)
to be held at Rutgers University from Saturday, July 27, to Saturday,
August 3. As well as CADE, other conferences participating in FLoC’96
will be CAV (Conference on Computer-Aided Verification), LICS (IEEE
Symposium on Logic in Computer Science), and RTA (Conference on
Rewriting Techniques and Applications). The goal of FLoC is to battle
fragmentation of the technical community by bringing together synergetic
conferences that relate logic to computer science.

The Proceedings of CADE-13 will be published by Springer-Verlag in
their Lecture Notes in Artificial Intelligence Series. Research papers
should not exceed 15 (fifteen) proceedings pages. System descriptions
and problem sets should not exceed 5 (five) proceedings pages. Springer
style files should be used if possible. These can be obtained from
http://www.research.att.com/lics/FLoC.

The title page of the submission should include the name, address (with
email address if possible) and telephone number of each author. To
assist in the refereeing process, please indicate one or at most two of
the following areas into which your paper falls, or if it does not fall
into any of these areas, please specify the area into which it falls:

      LOGIC: first order, higher order, classical, non-classical,
      constructive, type theory, induction, modal, non-monotonic.

      MECHANISMS: resolution, matrix, sequent calculus, natural
      deduction, semantic tableau, rewrite rules, unification,
      decision procedures, tactics, meta-level, interactive,
      analogy.

      APPLICATIONS: mathematics, geometry, databases, logic
      programming, functional programming, software/hardware
      verification/transformation/synthesis/termination, commonsense
      reasoning, expert systems, learning.

Papers must be unpublished and not submitted for publication
elsewhere. Submissions which are late, too long, or which require
major revision, will not be considered.

The Program Committee may ask authors to furnish evidence of
scientific claims, eg computer programs, detailed proofs, or full
experimental data.

          +———————————————–+
          | Submission deadline: 12 January, 1996         |
          | Notification of acceptance: 20 March, 1996    |
          | Camera-ready copy due: 26 April, 1996         |
          +———————————————–+

Authors should send 4 (four) copies of their submission to the Program
Co-Chairs. Further information about the conference may be obtained
from the Local Arrangements Chair or at the CADE-13 world wide web
site: http://www.research.att.com/lics/FLoC.

      Program Co-Chairs                      Local Arrangements Chair

      Michael McRobbie & John Slaney         Amy Felty
      Centre for Information                 AT&T Bell Laboratories
      Science Research                       600 Mountain Avenue
      The Australian National University     Murray Hill NJ 07974
      ACT 0200                               United States of America
      Australia

      Tel: [+61] 6-2492035                   Tel: [+1] 908-5824049
      Fax: [+61] 6-2490747                   Email: cade13…@cisr.anu.edu.au
      Email: cad…@cisr.anu.edu.au

                            Program Committee

O. Astrachan (Duke)                     J. Avenhaus (Kaiserslautern)
L. Bachmair (Stonybrook)                D. Basin (Max-Planck)
W. Bibel (Darmstadt)                    B. Buchberger (Linz)
F. Bry (Munich)                         R. Caferra (Grenoble)
K.S. Choi (KAIST)                       A. Cohn (Leeds)
L. Farinas del Cerro (Toulouse)         W. Farmer (MITRE)
A. Felty (AT&T Bell Labs)               M. Fitting (CUNY)
M. Fujita (MRI)                         S. Garland (MIT)
F. Giunchiglia (IRST)                   E. Gunter (AT&T Bell Labs)
R. Hasegawa (Kyushu)                    L. Henschen (North Western)
L. Hines (Texas)                        S. Hoelldobler (Dresden)
M. Kaufman (Motorola)                   A. Leitsch (Vienna)
E. Lusk (Argonne)                       U. Martin (St Andrews)
D. McAllester (MIT)                     W. McCune (Argonne)
H.-J. Ohlbach (Max-Planck)              J. Posegga (Karlsruhe)
W. Pase (ORA Canada)                    F. Pfenning (Carnegie Mellon)
F. Pirri (Rome)                         D. Plaisted (North Carolina)
U. Reddy (Illinois)                     M. Rusinowitch (INRIA)
K. Satoh (Hokkaido)                     J. Schumann (Munich)
C. Schwind (Marseille)                  N. Shankar (SRI)
J. Siekman (Saarbruecken)               A. Smaill (Edinburgh)
G. Smolka (Saarbruecken)                M. Stickel (SRI)
G. Sutcliffe (James Cook)               E. Tiden (Siemens)
A. Voronkov (Uppsala)                   L. Wallen (Oxford)
D. Wang (Grenoble)                      H. Zhang (Iowa)

——————————————————————————-

% For LaTeX2e use
\documentclass[a4paper]{article}
% if you have LaTeX2e and if you have "winning-logo.epsi" then
% uncomment the following line.
%\usepackage{graphicx}
% else, for LaTeX 2.09 comment out the two lines above and uncomment:
% \documentstyle{article}
% Furthermore, if you do not have the file "winning-logo.epsi",
% and if you do not have LaTeX2e comment out a line in the text
% below, which contains "\includegraphics".

\addtolength{\topmargin}{-2cm}
\addtolength{\textheight}{3cm}
\addtolength{\textwidth}{4.2cm}
\addtolength{\oddsidemargin}{-2cm}

\font\logofont=cmbsy10 scaled 3000
\font\logofontt=cmtt10 scaled 3000

\def\cadeC{{\logofont\char’032}}
\def\cadeA{\setbox0=\hbox{\cadeC}{\lower\dp0\hbox{\logofont\char’070}}}
\def\cadeD{{\logofont\char’033}}
\def\cadeE{\setbox0=\hbox{\cadeC}{\lower\dp0\hbox{\logofont\char’071}}}
\def\cadeArrow{{\logofont\char’041}}
\def\cadetwlv{\setbox0=\hbox{\cadeC}{\lower\dp0\hbox{\logofontt 12}}}
\def\cadethrt{\setbox0=\hbox{\cadeC}{\lower\dp0\hbox{\logofontt 13}}}

%\def\cadelogo{\cadeC \cadeA \cadeD \cadeE \cadeArrow \cadetwlv}
\def\cadelogo{\cadeC \cadeA \cadeD \cadeE \cadeArrow \cadethrt}

\def\cadewww{{\tt http://www.research.att.com/lics/FLoC/cade13}}

\parskip=1ex plus0.3ex minus 0.3ex

\pagestyle{empty}

\begin{document}

% comment out the following "\includegraphics" line, if you do not
% have LaTeX2e and if you do not have the file "winning-logo.epsi".
%\noindent
%{\hskip-1.5cm{\vskip-2cm\hskip-1.5cm\includegraphics[scale=0.2]{winning-logo.epsi}}}

\begin{center}
\Large\bf
Thirteenth International Conference on Automated Deduction \\[1ex]
Rutgers University, New Brunswick, USA \\[1ex]
30 July–3 August, 1996

\vskip0.4cm
{\cadelogo}

\vskip0.4cm
\huge\bf SECOND CALL FOR PAPERS
\end{center}

\vskip0.5cm
\noindent
The CADE conferences are the major forum for the presentation of
new research in all aspects of automated deduction.  Original
research papers, descriptions of working reasoning systems, and
problem sets that provide innovative, challenging tests for
automated reasoning systems, are solicited.

\vskip0.25cm
CADE conferences cover all aspects of automated deduction:
\begin{center}
\begin{tabular}{ll}
First {\em vs.}\ Higher Order Logics &
Classical {\em vs.}\  Non-Classical Logics \\
Special {\em vs.}\  General Purpose Inference &
Interactive {\em vs.}\ Automatic Systems
\end{tabular}
\end{center}

Specific topics of interest include (but are not limited to):
\begin{center}
\begin{tabular}{lll}
Resolution & Sequent Calculus & Decision Procedures \\
Unification & Rewrite Rules & Mathematical Induction
\end{tabular}
\end{center}

and any applications of automated deduction, including:
\begin{center}
\begin{tabular}{ll}
Deductive Databases & Logic and Functional Programming \\
Commonsense Reasoning & Software and Hardware Development \\
Distributed Theorem Proving & Learning Search Heuristics
\end{tabular}
\end{center}

{\em Papers on commercial or industrial applications of automated deduction
are especially encouraged.}

\vskip0.25cm
CADE-13
will be held as part of the Federated Logic Conference (FLoC’96) to be
hosted by the Center for Discrete Mathematics and Computer Science
(DIMACS) at Rutgers University from
Saturday, 27 July to Saturday, 3 August.  As well as CADE, other
conferences participating in FLoC’96 will be CAV, (Conference on
Computer-Aided Verification), LICS (IEEE Symposium on Logic in Computer
Science), and RTA (Conference on Rewriting Techniques and
Applications). % The goal of FLoC is to battle fragmentation of the
%technical community by bringing together synergetic conferences that
%relate logic to computer science.

The Proceedings of CADE-13 will be published by Springer-Verlag in
their Lecture Notes in Artificial Intelligence Series.  Research
papers should not exceed fifteen (15) proceedings pages.  System
descriptions and problem sets should not exceed five (5)
proceedings pages.  Springer style files should be used if possible.
These can be obtained from
\ \cadewww.

The title page of the submission should include the name, address
(with email address if possible) and telephone number of each author.
To assist in the refereeing process, please indicate one, or at most
two, of the following areas into which your paper falls or if it does
not fall into any of these areas, please specify the area into which
it does fall:

LOGIC:  first order, higher order, classical, non-classical,
constructive, type theory, induction, modal, non-monotic.

MECHANISMS:  resolution, matrix, sequent calculus, natural deduction,
semantic tableau, rewrite rules, unification, decision procedures,
tactics, meta-level, interactive, analogy.

APPLICATIONS:  mathematics, geometry, databases, logic programming,
functional programming, software/hardware
verification/transformation/synthesis/termination, commonsense
reasoning, expert systems, learning.

Papers must be unpublished and not submitted for publication elsewhere.
Submissions which are late, too long, or which require major revision,
will not be considered.

The Program Committee may ask authors to furnish evidence of
scientific claims, e.g. computer programs, detailed proofs, or full
experimental data.

\begin{center}
\framebox{\begin{tabular}{ll}
Submission deadline:          & 12 January, 1996 \\
Notification of acceptance:   & 20 March, 1996 \\
Camera-ready copy due:        & 26 April, 1996 \\
\end{tabular}}
\end{center}

Authors should send 4~(four) copies of their submission to the Program
Co-Chairs.  Further information about the conference may be obtained
from the Local Arrangements Chair or at the CADE-13 world wide web
site: \ \cadewww.

\begin{center}
\begin{tabular}{l@{\hspace{2em}}l}
\begin{tabular}[t]{l}
{\bf Program Co-Chairs\/}\\[1ex]
Michael McRobbie and John Slaney \\
Centre for Information Science Research \\
The Australian National University\\
ACT  0200 \\
Australia
\end{tabular}
&
\begin{tabular}[t]{l}
{\bf Local Arrangements Chair\/}\\[1ex]
Amy Felty\\
AT\&T Bell Laboratories \\
Room 2A-425 \\
600 Mountain Avenue \\
Murray Hill  NJ  07974  \\
United States of America \\

\end{tabular}\\
\hbox{}\\
\begin{tabular}[t]{l}
 Tel: [+61] 6-249-2035 \\
 Fax: [+61] 6-249-0747 \\
 Email: {\tt cade13}{\rm @}{\tt cisr.anu.edu.au}%
\end{tabular}
&
\begin{tabular}[t]{l}
 Tel: [+1 ] 908-5824049 \\
 Fax: [+1 ] 908-5827550 \\
 Email: {\tt cade13-la}{\rm @}{\tt cisr.anu.edu.au}
\end{tabular}
\end{tabular}
\end{center}

\vskip0.5cm
\begin{center}
{\bf Program Committee\/}
\end{center}

\begin{center}
\begin{tabular}{lll}
O.~Astrachan (Duke)& J.~Avenhaus (Kaiserslautern)& L.~Bachmair (Stonybrook)\\
D.~Basin (Max-Planck)& W.~Bibel (Darmstadt)& B.~Buchberger (Linz)\\
F.~Bry (Munich)& R.~Caferra (Grenoble)& K.~S.~Choi (KAIST)\\
A.~Cohn (Leeds)& L.~Farinas del Cerro (Toulouse)& W.~Farmer (MITRE)\\
A.~Felty (AT\&T Bell Labs)& M.~Fitting (CUNY)& M.~Fujita (MRI)\\
S.~Garland (MIT)& F.~Giunchiglia (IRST)& E.~Gunter (AT\&T Bell Labs)\\
R.~Hasegawa (Kyushu)& L.~Henschen (North Western)& L.~Hines (Texas)\\
S.~H\"olldobler (Dresden)& M.~Kaufmann (Motorola)& A.~Leitsch (Vienna)\\
E.~Lusk (Argonne)& U.~Martin (St.~Andrews)& D.~McAllester (MIT)\\
W.~McCune (Argonne)& H.-J.~Ohlbach (Max-Planck)& J.~Posegga (Karlsruhe)\\
W.~Pase (ORA Canada)& F.~Pfenning (Carnegie Mellon)& F.~Pirri (Rome)\\
D.~Plaisted (North Carolina)& U.~Reddy (Illinois)& M.~Rusinowitch (INRIA)\\
K.~Satoh (Hokkaido)& J.~Schumann (Munich)&  C.~Schwind (Marseille)\\
N.~Shankar (SRI)& J.~Siekmann (Saarbr\"ucken)& A.~Smaill~(Edinburgh)\\
G.~Smolka~(Saarbr\"ucken)& M.~Stickel~(SRI)& G.~Sutcliffe (James Cook)\\
E.~Tiden (Siemens)& A.~Voronkov (Uppsala)& L.~Wallen (Oxford)\\
D.~Wang (Grenoble)& H.~Zhang (Iowa)& \\
\end{tabular}
\end{center}
\end{document}

posted by admin in Uncategorized and have No Comments

Quantitative Tense Logic?

I am looking for works on quantitative tense logic (used to formalize
statements like "five minutes ago it was the case that …".) Burges (Basic
Tense Logic, in: Handbook of Philosophical Logic vol. II) reported that some
works have been done, but gave no references. Can anyone help? Many thanks.

Ho Ngoc Duc ********************************************************
Uni: Leipzig, Inst. f. Logik & Wiss.theorie, PF 920, D-04009 Leipzig
URL:    http://www.informatik.uni-leipzig.de/privat2/duc/www.html
E-mail: d…@informatik.uni-leipzig.de

posted by admin in Uncategorized and have No Comments

[Q] Quantified Modal Logic

        Intuitionist predicate logic can be interpreted in quantified S4 by the
mapping *t* defined as
                t(p)    =       []p
                t(A & B)=   t(A) & t(B)
                t(A v B)=       t(A) v t(B)
                t(A –> B)=  [](t(A) –> t(B))
                t(-A)   =       []t(A)
                t(UxPx) =       [](Ux)t(Px)
                t(ExPx) =       (Ex)t(Px).

Question: in the usual Kripke-semantics for intuitionist predicate logic, the
domains must be nested, i.e., if *a* and *b* are two nodes and *Da* and *Db*
are the respective domains of these nodes, then if *aRb* (where *R* is the
usual partial-ordering), then *Da* is a subset of *Db*. Given the
interpretability of intuitionist predicate logic in quantified S4, does this
mean that the domains in a model for quantified S4 are nested? [In other words,
does quantified S4 really have any models in which the domains aren't nested?]

        The mapping *t* can be used to interpret classical predicate logic in
quantified S5. Does this mean that the domains in models for quantified S5 are
nested? [In other words, does quantified S5 have models in which the domains
aren't nested?]

posted by admin in Uncategorized and have No Comments

A NEW BOOK OF QUANTUM MECHANICS

Please, inform us if you have interest to puchase or to sell a
new book of quantum mechanics that is appearing now, in December  1995.
The title of the book is Meccanica Quantistica Biquaternionica
(title: Biquaternion Quantum mechanics, author: Elio Conte). This
is a new book in physics with new themes in science. The author
formulates in a book the important results that he has obtained in the
last few years using Clifford algebra (see, i.e., Physics Essays ).
He generalizes the usual quantum mechanics and delineates the scheme
of a new theory in which, i.e., basic problems as the reduction of the
wave function or also the existence of hidden variables in Nature have,
for the first time, a satisfactory solution. The new theory configures
a new quantum logic as well as a new epistemology of quantum reality.
Therefore the new theory offers important perspectives at the basic
level of knowledge as well as at the level of the application, par-
ticularly for nuclear technologies and, in particular manner for the
cold fusion. Please, send your requests to E-mail: conte @teseo.it.

posted by admin in Uncategorized and have Comments (5)

Q: Reference on temp.modal logic

Hi,

i am looking for a (not too old) overview on temporal modal logic or on modal
logic with temporal aspects…

Thanks for hints, bye, Uli

posted by admin in Uncategorized and have Comments (2)

Re: 2-variable systems for propositional logic?

- Hide quoted text — Show quoted text -

Christian Fermueller (chr…@csdec1.tuwien.ac.at) wrote:
} Can anyone answer the following question and/or give
} appropriate references?
}
} Is there a Hilbert-style calculus of (classical) propositional
} logic, where each axiom schema and derivation rule
} contains at most two different propositional variables? If
} not, how do you prove that such a system cannot exist? (I
} do not care which connectives the system is based on, as
} long as we have functional completeness.)
}
} To avoid some misunderstandings:  By Hilbert-style
} calculus, I mean a finite number of axiom schemata (like:
} A -> (B -> A)) and rules (like modus ponens or:
} |- A  =>  |- A v B).  Usual systems contain axiom
} (schemata) like: (A -> B)  -> [(B -> C) -> (A -> B)], which
} contains _three_ propositional variables. The question is,
} whether this is necessarily so, and why (not)?

In Hilbert and Ackermann’s _Principles of Mathematical
Logic_ 1950 p. 27, four axioms of classical propositional
logic are given.  Only the last axiom uses more than two
variables.

1.  (A > B) > [(C > A) > (C > B)]

The previous formula is equivalent to the following:

2.  [(C > A) & (A > B)] > (C > B)

Formula 2 represents the transitivity of implication.  
Transitivity, a necessary property of classical logic, requires
at least three variables for its representation.

Neil Nelson

posted by admin in Uncategorized and have Comments (6)

Journalism Lite #9 [O.J., religion]

FORWARDED FROM: /professional/law/first/news(#409) From:croth(Chris Roth)
                      14 December 1995
                    Opinion and Analysis
:::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
:::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
:::::::: T h e  F i r s t  A m e n d m e n t  T e a c h – I n :::::::::
:::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::
:::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::::

                     ++++++++++ ++++ ++
              * * * * * * * * * *  * * * *  *  *
    J   O   U   R   N   A   L   I   S   M     L   I   T   E     #  9
_______________________________________________________________________
               Topics in this issue:

               * coverage of the Simpson trial

               * invisibility of "the religion card"
                 in content diffused via news outlets
_______________________________________________________________________
                      ==========
                      DEFICIENCY
                      ==========
::::::
::
::
::
::::::overage of events surrounding Orenthal James Simpson in 1994
and 1995 were unprecedented. Professor Dave Berkman, media critic
for the alternative Milwaukee weekly _Shepherd Express_, deemed the freeway
chase as "the most transfixing six hours in television history." This puts
the Apollo 11 moonwalk in an interesting perspective.

What-a-year-it-was TV specials are
about to remind Americans once again of the Simpson saga.
[Indeed, the first year-in-review
already aired on CBS on 13 December 1995--19 days before 1996
even begins.]

Network TV, basic cable, local TV stations, radio network,
radio stations, magazines, national newspapers, and local newspaper
reporters, columnists, and editorialists diffused
endless analyses of the Simpson trial and verdict.

Yet even in this gee-whiz
age of fiber optics, mobile satellite uplinks, portable
FAX machines, live helicopter feeds, and computer-assisted journalism,
a huge societal faction enjoyed exemption from scrutiny: religionists.

 ::::
::  ::
::::::
::  ::
::  ::lthough it was permissible to discuss the alleged playing
of "the race card" [articulated, ironically, by defense attorney
Robert Shapiro], it was the repeated use of the religion card
that was actively kept invisible–deliberately or
inadvertently–by media workers. Why anger clergymen?

                 ==============
                 FRAME ANALYSIS
                 ==============
::
::
::
::
::n the culture of 1995, any ordinary analysis of religious
ideas is beyond the boundaries of socially-acceptable
discussion or debate. Presented below is part of the pattern
of superstition unreported in 1994 and 1995.
[see UNREPORTED PATTERN, below].

                     ======
                     EFFECT
                     ======
::::::
  ::
  ::
  ::
  ::he calculated pushing of irrational "hot buttons"
by "the dream team" was a newsworthy issue,
deficient reportage notwithstanding. It may have caused
jurors to submit no-guilt votes despite the overwhelming
evidence provided by prosecutors.

[Insofar as the impact of let's-keep-the-religious-component-
of-the-defense's-pitch-invisible on media users, see
mass communication research
findings on the agenda-setting function of
news outlets, frame analysis*, and
the newly-discovered "spiral of silence."]

                 ==================
                 UNREPORTED PATTERN
::  ::           ==================
::  ::
::::::
::  ::
::  ::ere is an excerpt from Orenthal James Simpson’s
mass market book titled _I want to Tell You_. Despite
DNA findings, the book asserted–in several places–
that the admitted wifebeater was innocent.

[begin book excerpt]

Some of the letters validated what my mother was telling
me over and over, that the Lord was really forging me
for something else, something better.

[end book excerpt]

::::::
::  ::
::  ::
::  ::
::::::n 23 June 1994, Reverend Richard Halverson led the US
Senate in a prayer. The clergyman did not mention
either of the LA CA murder victims.

[begin prayer excerpt]

We pray for O.J., whether he is innocent or guilty
rests with our system of justice. But our hearts
go out to him in his profound loss.

[end prayer excerpt]

::::::
::  ::
::  ::
::  ::
::::::n 30 January 1995, defense attorney Johnnie Cochran
told the jury:

[begin excerpt]

He, like all of us, has made mistakes. Of course, we
know of only one perfect person that ever walked the
earth.

[Cochran did not tell the jury that his own ex-wife, in
her book, alleged that the flashy attorney had slapped her 'round.]

[content deleted]

He has been blessed bountifully by god, shared his largess
with many, many people.

[end excerpt]

::::::
::  ::
::  ::
::  ::
::::::n 12 February 1995, the jurors were led on a tour through
the murder suspect’s posh mansion. One of the tables
sported a neatly-placed Bible.

::::::
::
:::::
::
::ive months later, one of the "dream team"
attorneys argued against jury access to test results
produced by a credentialed scientist. The following
sentences began at 12:25 PM EST on 24 July 1995.

[begin excerpt]

The hand of almighty god can make anything happen.

[content deleted]

[The scientific certainty is] not 100%, because he’s not god.

[end excerpt]

::::::
::
:::::
::
::rom Cochran’s 28 September 1995 closing arguments:

[begin excerpt]

The Book of Luke talks about that.

[content deleted]

In Proverbs it talks a lot about false witnesses.

[end excerpt]

::  ::
::  ::
::::::
::  ::
::  ::ere’s an excerpt from a post-verdict local TV report
aired in Milwaukee WI. "M’woky"–a major American city–is noted
for its averageness by demographers.

WITI-TV [VHF 6, SE WI] reporter Rosalind Jordan spoke to viewers about
the differing views of
Americans on the controversial verdict. Citizen opinions
were, to a significant degree, divided along racial lines.
Milwaukeeans were interviewed. Canned footage. Ms.Jordan’s concluding
sentence aired at 9:13 PM CST on 11 October 1995. Here it is:

[begin excerpt]

Communication, including prayers, seem to be the answer.

[end excerpt]

The same newscast included a Fox feed from CA. Topic?
Reversal of Simpson’s agreement to be interviewed
at length by NBC journalists. The reporter,
speaking about a 500-person let’s-silence-NBC News rally in Burbank,
yapped about a nonexistent "National Organization of Women."

In fact, the group that demanded censorship
–working with local animal rights groups–was the LA chapter of the
National Organization for Women.

::::::
  ::
  ::
  ::
  ::hat same week in October, one male juror was interviewed
a network journalist. In the first prime time, one-to-one,
at-length interview with any juror, the interviewer asked him how
he made it through the trial. On nationwide television,
the juror mentioned prayer.
_____________________________________________________________________
FOOTNOTES

*Here is an excerpt from page 7 of Todd Gitlin’s 1980 book
_The Whole World is Watching_:

[begin excerpt]

[Media frames are defined as] persistent patterns of cognition,
interpretation, and presentation, of selection, emphasis, and
exclusion, by which symbol-handlers routinely organize discourse,
whether verbal or visual.

Frames enable journalists to process large amounts of information
quickly and routinely: to recognize it as information, to assign
it to cognitive categories and to package it for efficient
relay to their audience.

[end excerpt]

See also E. Goffman’s 1974 _Frame Analysis: An Essay on the
Organization of Experience_.

                                       (c) 1995 by Chris Roth.
                                       All rights reserved.
                                       fi…@omnifest.uwm.edu

posted by admin in Uncategorized and have No Comments

Decidable fragments of Relational Algebras?

Hello:

I am interested in decidable fragments of the equational
theory of relational algebras. The full theory is undecidable.
See the reference below.

An Undecidability Result for Relational Algebras
Wolfgang Schonfeld
The Journal of Symbolic Logic, Volume 44, Number 1, March 1979

Please send me e-mail.

Thanks

Somesh

posted by admin in Uncategorized and have No Comments