Cogreee

2013 EUROPEAN SUMMER MEETING OF THE ASSOCIATION FOR SYMBOLIC LOGIC LOGIC
COLLOQUIUM '13: Evora, Portugal July 2227, 2013

Source: The Bulletin of Symbolic Logic, Vol. 20, No. 2 (JUNE 2014), pp. 204-255
Published by: Association for Symbolic Logic
Stable URL: http://www.jstor.org/stable/23800717 .
Accessed: 09/10/2014 14:23
Your use of the JSTOR archive indicates your acceptance of the Terms & Conditions of Use, available at .
http://www.jstor.org/page/info/about/policies/terms.jsp
.
JSTOR is a not-for-profit service that helps scholars, researchers, and students discover, use, and build upon a wide range of
content in a trusted digital archive. We use information technology and tools to increase productivity and facilitate new forms
of scholarship. For more information about JSTOR, please contact support@jstor.org.
Association for Symbolic Logic is collaborating with JSTOR to digitize, preserve and extend access to The
Bulletin of Symbolic Logic.
http://www.jstor.org
This content downloaded from 194.27.186.191 on Thu, 9 Oct 2014 14:23:13 PM

All use subject to JSTOR Terms and Conditions
Thi; Bulletin
of Symbolic Logic
Volume 20. Number 2. June 2014
2013 EUROPEAN
OF THE
SUMMER
ASSOCIATION
LOGIC
FOR
MEETING
SYMBOLIC
'13
COLLOQUIUM
Evora,
LOGIC
Portugal
July 22-27,2013
Logic
bolic
was
The
University
gal's
most
Santo,
(ASL);
and
Systems
Analysis.
Kurt
Godel
The
success
The
other
van
den
Daniel
Evora
(Univ.
Pedro
was
due
were
and
Center
Artificial
In
for Mathematical
of Lisbon;
University
for
Portuguese
and.
Portugal;
the
Sandra
Alves
Instituto
SQIG
Coimbra
(Univ.
and
Committee
Program
Mario
main
Edmundo
consisted
Paolo
University),
of
Sakae
(Lisbon),
conference
(Univ.
Ferreira
Constructive
Mathematics;
invited
were
Mancosu
eight
free groups.
Luke Ong
and
and
lectures,
plenary
contributed
awarded
following
Abderezak
Porto
(Univ.
Organizing
and
CMAF).
and
LIACC).
Lisbon
and
de Telecomunicapoes),
Imme
CMAF).
Marcello
Mamino
Luis Pinto (Univ. Minho and
and
CISUC).
Local
Aberta
(Univ.
Joao
Rasga
and
(IST-UTL
ASL
tutorial
Ould
(Oxford
Baaz
(Kobe),
Katrin
(Berkeley).
(Vienna),
Michael
Valentina
Harizanov
Tent
(Muenster),
Benedikt
(George
and
Boban
travel
Set
Theory.
and
twenty
and
invited
lectures
168 participants.
in five special
Twenty
sessions.
two students
and
There
recent
grants.
were
(University
University),
Science;
Theory and Logic for Computer
of Logic;
Model
Proof Theory
and
Theory;
The program
included
two tutorial
courses,
Philosophy
talks
courses
Houcine
Matthias
Fuchino
were Computability
topics
of Mathematics
seventy
of the
work
Edmundo
de Telecomunicacoes).
Foundations
The
Mario
Fernando
CIMA),
Velickovic (Paris, Chair).
Ph.D's
Logic
in Mathematics
Center
for Mathematics.
to the hard
largely
of its Chair,
and
Algarve
Quaresma
Instituto
Washington
were
of Aveiro;
Center
for Mathematics,
of Porto;
Technical
Center
for Symbolic
University
Center
Colegio
for Applied
and Funda
for Research
Center
and
Research
Manuel Martins (Univ. Aveiro and CIDMA),
(Oxford),
eleven
the
University
Systems,
of the committee
(Univ.
Berg
Gra?a
The
Lisbon;
of Coimbra;
International
the leadership
members
(CMAF),
The
Center
University
by the
Heritage
classrooms.
Portugal;
of Evora;
World
of the university.
the Association
(CIDMA),
Dynamical
of the meeting
under
CMAT),
10 spacious
Applications
Laboratory,
declared
building
by:
of
University
(SPM);
was
Society.
Committee
SQIG
and
Geometry,
contains
provided
University
and
Science
of Mathematics
Society
and
was
(CISUC),
Computer
which
at the main
e a Tecnologia,
(CIMA-UE).
Applications
and
1559
(CMAF),
in Mathematics
Informatics
telligence
from
held
of the Association
for Sym
from July 22 to July 27, 2013.
one of Portu
city center of Evora,
Meeting
Portugal,
the historic
towns,
were
a Ciencia
para
Mathematics
Development
all over
for the conference
Funda<;ao
mental
lectures
dates
of Evora,
medieval
preserved
which
funding
Major
is spread
The
Summer
European
by the University
of Evora
in 1986.
Espirito
and
hosted
beautifully
UNESCO
the 2013
'13,
Colloquium
Logic,
given;
of Lyon),
Higher-order
Introduction
model
to elementary
properties
of
checking.
2014. Association for Symbolic Logic

1079-8986/14/2002-0004/S6.20
D0!:10.1017/bsl.2014.10
204

LOGIC
The
invited
following
Johan
van
lectures
plenary
Benthem
were
presented:
of Amsterdam),
(University
205
'13
COLLOQUIUM
Logical
and
of games
foundations
inter
action.
(Kobe
IemholT
Rosalie
the topology
Steffen
Lempp
(University
enumerable
Turing
Morozov
On rules.
Pierre
et Marie
The
of Pure
inst. of Math,
to stably
minimal
pair
of computuhly
and
Cofinality
spectrum
Novosibirski
State
sets.
on admissible
Bourgogne
Dijon).
problems.
University),
Computable
based
an approach
de
(Universite
Weierstrass
in
preparation
set-theoretic
view of classifica
algebras.
for Advanced
(Institute
Voevodsky
of Logic
and Applied
A descriptive
of Copenhagen).
(University
in operator
proceedings
'
Colloquium
Study).
Foundations
Univalent
13 will be published
of Mathemut
issue
in a special
of the Annals
Logic.
information
More
dendrites
rings.
AsgerTornquist
Vladimir
A strong
of Chicago),
(University
Rolin
tion problems
universal
spaces.
of Wisconsin-Madison).
(Sobolev
local
quasianalytic
From
Curie).
of nonarchimedean
theory over the reals:
Jean-Philippe
the size of the continuum.
degrees.
Malliaris
Maryanthe
Andrey
in sets with atoms.
Computation
theory and
Forcing
University).
(Universite
types:
dominated
University),
University).
(Utrecht
Loeser
Francois
model
(Warsaw
Bojanczyk
Mikotaj
Jorg Brendle
the meeting
about
can
be found
at the conference
webpage.
http://
ptmat.fc.ul.pt/LC2013/.
of invited
Abstracts
Association
and
talks
contributed
in person
given
or by title by members
of the
follow.
For the Program
Committee
Boban
Abstracts
ABDEREZAK
tutorials
of invited
HOUCINE.
OULD
Velickovic
to
Introduction
elementary
free
properties
of
Bernard
Lyon
groups.
Institut
11 novembre
du
ouldQmath.
E-mail:
1918.
cones,
We introduce
recent
Claude
1.
France.
developments
the basic
tools
as limit
on the elementary
actions
groups,
theory
on trees,
we explain
how they can be used in the study
closure,
and
on homogeneity,
algebraic
and
JSJ-decompositions.
We focus
theory.
of the elementary
cedex.
Villeurbanne
of some
an overview
free groups.
of nonabelian
Universite
Braconnier,
69622
f r.
univ-lyonl.
We give in this tutorial

asymptotic
Batiment
Jordan.
Camille
43 boulevard
in particular
ampleness.
[1] A.
Houcine.
Ould
Mathemutici,
Confiuentes
Houcine
[2] A. Ould
[3] A.
ArXiv.
* LUKE
Ould
Houcine
and prime
Homogeneity
vol.
3 (2011),
no.
and
K. Tent.
Ampleness
and
D.
1. pp.
Vallino.
models
in trosion-J'ree
hyperbolic
groups.
121-155.
in the free group.
Algebraic
and
definable
ArXiv,
2012.
closure
in free
groups.
2011.
ONG.
Department
Oxford
OX1
E-mail.
Luke.
Higher-order
of Computer
3QD,
model
Science.
checking.
University
of Oxford.
Wolfson
Building.
UK.
OngQcs
. ox. ac.
uk.

Parks
Road.
206
LOGIC
This
tutorial
is about
in the model
checking
higher-order
-
Recursion
and
programs.
recursion
schemes
Collapsible
order
are
We
and
begin
collapsible
the simply-typed
recent
lambda
of infinite
structures
are a generalization
are iterations
the verification
the expressive
such
of stack
calculus
of pushdown
of stacksthat
of semantics
and
graphs
functional
theme
State
AN.
Key
A strong
Sciences.
of invited
People's
barmpaliasfflgmail.
of Mathematics,
Department
E-mail:
mcaifflmath.
wise.
E-mail:
lemppQmath.wisc.edu.
of Mathematics.
We show
of ideas
to higher
symbols
the algorithmic
We survey
properties
to
applications
of "practical"
developments
between
equipped
fields
theneighboring
talks
plenary
CAI, STEFFEN
Institute
Science,
LEMPP. AND THEODORE
enumerable
of computably
Turing
degrees.
of Software,
Chinese
of
Academy
of China.
Republic
University
of Wisconsin,
Madison.
University
of California,
Berkeley.
WI
53706.
USA.
94720,
USA.
edu.
Department
slamanfflmath.
recursion,
com.
E-mail:
E-mail:
pair
of Computer
100190.
Beijing
and
on recent
programs,
MINGZHONG
minimal
Laboratory
of
verification.
BARMPALIAS,
A. SLAM
with
automata
contain
by them.
generated
is the fruitful interplay
algorithmic
Abstracts
GEORGE
of the two models
power
as trees and
of higher-order
A central
algorithms.
models
automata.
pushdown
with links.
We study and compare
developments
two
by studying
symbols.
automata
pushdown
stackswhich
that underpin
algorithms
schemes
in essence
from first-order
generated
the foundations
of higher-order
computation:
13
COLLOQUIUM
CA
edu.
berkeley.
minimal
enumerable
pair in the computably
Turing degrees,
i.e.. a pair of nonzero
c.e. degrees a and b such that a n b = 0 and for any nonzero
c.e. degree
x < a. b U x > a. (This result had been claimed
several times before in both directions.)
JOHAN
that there is a strong
VAN
Institute
94242.
1090
E-mail'.
GE
E-mail:
and
to logic
calculi
The
Netherlands.
Stanford
game
theory
and interaction.
of games
(ILLC),
University.
open
issues:
[2 ]
lead
such
Blnthem.
Cambridge.
. Logic
MIKOLAJ
Institute
about
eventually
problems,
sity Press,
can
We will explain
for reasoning
might
in two ways.
play, but games

of basic
[1] J. van
Sets
Amsterdam,
as games.
on a number
E-mail:
Computation
of Philosophy,
meets
Logic
foundations
and
of Amsterdam.
University
P.O.
Box
Stanford.
CA
94305.
USA.
johan8csli.stanford.edu.
of games
and
Logical
Language
johanscience.uva.iil.
Department
which
BENTHEM,
for Logic,
they were
nominal
sets.
The
languages,
see the book
MIT
Computation
University
sets
with games
are taking
of logic,
today,
including
automata
solutions,
game
strategic
We will also
interaction
out
point
some
leading
results
complete
in games,
challenges
in computation.
and interaction.
of information
the foundations
notions
place
defining
flow, and
and
to analyze
the basic
equivalence,
are
Press.
Cambridge
Univer
MA.
Cambridge,
2013.
in sets with atoms.
of Warsaw,
as permutation
by Fraenkel
rediscovered
Nominal
are used
2013.
BOJANCZYK,
decade,
of game
dynamics
in names.
in set theory
of games
to analyze
these contacts
as interfacing
UK.
Logics
be used
information
rationality,
to a "Theory
of Play".
bojanfflmimuw.edu.pl.
with atoms
known
(also
introduced
how
levels
Logical
for Informatics,
also
in 1922.
and
Banacha
models,
2. Warszawa
or Fraenkel-Mostowski
further developed
for the computer

science
an active research
topic
02-097,
by Mostowski.
Poland.
sets)
were
In the last
where they are called

community,
in the semantics
of programming
[3].

LOGIC
This
talk
is about
makes
only
is to see what
motivated
is replaced
which
programme,
atoms,
called
mathematics
when
by orbit-finiteness.
science,
by computer
studies
a notion
Two
are orbit-finite
sets are
research
which
programme
by sets with atoms,
replaced
of this research
examples
versions
of finiteness
The
"orbit-finiteness".
of programming
programme,
and
languages
of
machines.
Turing
with
to discrete
happens
finiteness
and
a research
in sets
sense
207
'13
COLLOQUIUM
Programming
one
In sets
languages.
is an orbit-finite
order
write
can
of rational
with
atoms,
set. Therefore,
the following
numbers,
the set of rational
in a programming
which
program,
with
their
for sets with atoms,
searches
exhaustively
for a counter-example
searching
numbers
language
all triples
through
to transitivity
of the order:
counterexample:=false
for x in Q do
y in Q do
for
z in Q do
for
if
<
(x
and
y)
<
(y
and
z)
not
<
(x
then
z)
counterexample:=true
This
The
programming
in [2].
are considered
NP
nondeterministic
for normal
and
Bojanczyk
Proceedings
Theoretical
Computer
[3] Andrew
Annual
2013.
School
657-8501.
Japan.
in which
this richness
consistent
size
a statement
support
true in the iterated

when
a statement
The
In the past
developedand
most
Ni.
a powerful
model
is larger,
whether
which
ac.
used
Szymon
Torunczyk.
on Logic
in
science.
Cambridge
UK.
Cambridge.
2013.
(an
to solve
of many
comprehensive
and
picture
a plethora
hold
have
versatile
to intrinsic
c =
been
of novel
old
Nada.
Kobe
with
The
our
forcing
combinatorial
Perhaps
of new consistency
models,
by
is much
axioms
like
statements
onto
example
the reals".
even
more
results
P-point
Ni
for
obtained
knowledge
A concrete
when
c =
reason
such
all models
continuously
of A. Miller).
models
strong
K2 is open.
statements
obtained
for producing
are many
that there are neither

c >
has been
constructed.
reasonse.g..
be mapped
old result
1-1.
combinatorial
of different
technique
N2there
with c >
the possibility
to imply
a number
Rokko-dai
jp.
In fact,
of size c can
it is consistent
is known
years,
with
Technology
Symposium
Press.
of proper forcing.
Unfortunately,
c < Kj. and for larger continuum
imply outright
Nt whose consistency
the continuum
it is unknown
and
in computer
University.
the independence
axiom
Sacks
of Software
IEEE
University
Kobe
statements
iteration
sets of reals
is "all
Annual
and symmetry
Cambridge
to show
(at most)
is that we have
forcing
with c =
in sets
programming
Lasota.
Slawomir
Names
.kobe-u.
used
this technique
necessarily
satisfy
While this is partially
due
poorer.
the proper
Imperative
of the 2Sth
Informatics.
contradictory
countable
namely
Klin.
sets:
of the real line.
mutually
(unlike
pp. 4-15.
Science.
scitec
has been
c has
problem).
decidability
coincide).
on Foundations
Conference
that
different from
P vs NP
deterministic
the two notions
alphabets
in the sense
P is provably
on the real
light
and
spaces
richer,
theory and the size of the continuum.
Forcing
the structure
the continuum
Nominal
of System
theory
to
to appear.
brendleQkurt.
Forcing
any
not imply
Torunczyk.
2012.
Bartosz
set counterexample
state
becomes
For instance.
to shed
Proceedings
Computer
BRENDLE.
Graduate
E-mail:
Science.
M. Pitts.
in Theoretical
JORG
about
Szymon
with atoms.
Science.
Tracts
and
Bojanczyk.
machines
with orbit-finite
landscape
does
where
of the I ARCS
Computer
[2] Mikolaj
Turing
is unlikely
will never
in [1],
models.
decidability
machines,
Turing
[1] Mikoi.aj
atoms.
between
this result
(although
machines
Turing
the computability
there are fewer equivalences

Also,
is described
language
When
machines.
Turing
in finite time, and
will be executed
programme
true.
arises.
of such
This
is
importantly,
For example,
nor Q-point
ultrafilters.
N;?.
forcing
problemslike,
techniques
for large
for example.
continuum
Shelah's

have
iteration
been
along
208
LOGIC
or, more
templates
search
for such
1 will explain
iterations
instead
new
and
iterated
some
some
present
iterations
recently,
by Aspero
(independently)
recent
which
very
of the Cohen
by Neeman.
is an interesting
of forcing
for adjoining
many
by finite support
and important
problem,
with large continuum,
I will
theory
new
iterations
speaking
added
of models as side-conditions,
pioneered
In my talk. I will motivate
why the
difficulties
roughly
reals
and
constructions
forcing
technique(s)
are
with sequences
Mota,
of the technical
13
COLLOQUIUM
real
numbers
reals
in limit
I will mention
and
iterations,
shattered
like, e.g.,
random
adding
stages
some
open
problems.
ROSALIE
On rules.
IEMHOFF,
Utrecht
University,
E-mail:
R.IemhoffOuu.nl.
Mathematical
true even
ered.
Janskerkhof
theories
if only
In many
in general
can
theories
These
allow
so-called
arithmetic
rules
has
become
unification
much
has
theory
In this talk
better
come
Pierre
At the end
et Marie
of the
share
of such
a space,
with
E.
the space
of stably
dominated
Hrushovski
arXiv:
and
proved
in 1874
it is the smallest
Cedex
class
or
logic
of these
such
rules
and
the topology
types:
of
05, France.
of analytic
in many
branches
One
spaces.
and
in 1923
basic
by Wazewski.
obtained
spaces
geom
example
In
in
recently
of quasi
analytifications
retract
strongly
in nonar
spaces
of arithmetic
of the most
that nonarchimedean
to a finite polyhedron.
way on the pro-definable
Nonarchimedean
spectrum
Our
character
of
tame
and
topology
dominated
stably
been
of Chicago,
uchicago.
edu/~
that the continuum

uncountable
which
done
problems.
University
the size
measure
classification
problem
as of an a priori
can
be translated
completely
in model
unrelated
using
into
open
these
most
Shelah
theory,
model-theoretic
and
arose
cardinal
famous
1948,
question
instances
A program
of the continuum
between
The oldest and perhaps

open.
in
a
case by Rothberger
proved
special
how recent work of Malliaris
and
explain
S. University
Avenue,
IL
Chicago
mem.
cardinal.
on inequalities
5734
is uncountable,
was
solved
a new
analytic
remained
and
between
dominated
Paris
in an essential
relies
F. Loeser.
memfimath.uchicago.edu.
Address:
//math.
http:
questions
modal
the variety
types.
Cofinality
of Mathematics,
of the continuum,
scale
75252
ubiquitous
namely
and
60637, USA.
well
connection
to stably
Jussieu
contractible
MALLIARIS,
has
and
years
1009.0252.
Department
work
intuitionistic
was already
constructed
on the topology
of such
results
Hrushovski,
theoretic
whether
without
in this area.
introduced
dendrite,
recent
present
is model
Cantor
in their
mentioned
to the axiomatization
In recent
a close
dendrites
of complex
the universal
approach
URL
remains
are consid
fr.
properties
are locally
E-mail:
and
are becoming
varieties
M.
as
rules.
of results
Berkovich
which
projective
[1] E.
such
admissible
4 place
Curie,
1980's,
many
we shall
collaboration
types.
rules,
from it.
theories
universal
LoeserQupmc.
geometry
etry and
this talk
be added
This
ways.
and
spaces.
Francois.
chimedean
be derived
different
of axioms
that are not explicitly
steps
rules can
understood
in many
to light.
From
LOESER.
nonarchimedean
Universite
nontrivial
the Netherlands.
consisting
inference
I will give an overview
FRANCOIS
E-mail.
have
Utrecht,
be formalized
admissible
the set of theorems

that can
changing
As it turns out, many nonclassical
Heyting
BL
formalizations,
proof-theoretic
cases
axiomatization.
3512
13a,
in various
led to the solution

in model
of a more
theory.
fundamental
basic
is whether
of Keisler's
proof
problem
methods.

t," which
The
talk
will
a large
in ZFC
as
order,
of this problem
The
much
questions
"p
1934.
asks
invariants
Though
some
on Hausdorff
on the structure
first problem
ways.
invariants,
of these
building
Hilbert's
to study cardinal
shows
which
how
both
is stated
LOGIC
Partially
[1] M.
by the NSF
supported
Malliaris
and general
and
math.
topology,
. General
[2 ]
ANDREY
S. MOROZOV.
Sobolev
Institute
Novosibirsk.
spectrum
prize
fellowship.
in model
problems
theory, set theory
meets
model
theory, on p and t. announcement
model
Computable
over the reals:
theory
of the results
an approach
based
on
of Mathematics,
Ave. 4. 630090,
Koptyug
and
Novosibirsk
State
University.
Russia.
morozovQmath.
nsc.
model
theory
Computable
If we replace
the classical
at a natural
is HF(R),
ru.
is based
on the classical
of the concept
structure
Here
[2].
one
on a hypothetical
like computability
over admissible
of a computable
of the most
finite superstructure
the hereditarily
over the natural
computability
with I-definability
computability
generalization
of I-definable
looks
Cofinality
Research
sets.
admissible
E-mail.
by a Godel
L0/1208.5424.
topology
of [1].
and
S. Shelah.
209
13
COLLOQUIUM
structure,
over
the reals,
in which
computer
namely,
admissible
interesting
since
we have
numbers.
sets [1], we arrive

to the concept
sets to work
'"real"
with
over
I-definability
reals,
it
not their
approximations.
In the talk, there will be presented
for concrete
tations
structures
of the
same
over
these
I-presentable
in classical
on
We also
theory.
on the existence
of pairwise
the existence
of questions
groups
model
computable
results
on the numbers
and
structure,
structures;
and discussed
HF(R).
of I-presentations
of I-parameterizations
follow
discuss
the usual
some
presen
non-I-isomorphic
of classes
list of problems
new methods
and
of
studied
effects arising
on this way.
[1 ] J. Barwisc.
New
York,
[2] Yu.
Admissible
New
and
Oxford,
Berlin.
Springer-Verlag,
ROLIN,
of algebraic
Heidelberg.
Singapore.
1998,
Tokyo,
1. Elsevier.
J. B. Remmel.
editors),
Lausanne.
Amsterdam,
pp. 235-260.
in quasianalytic
Weierstrasspreparation
1MB. Faculte
mathematics
ofrecursive
A. Nerode.
vol.
Laboratoire
de Bourgogne-
Handbook
systems.
S. S. Goncharov,
of Mathematics,
Foundations
Shannon,
JEAN-PHILIPPE
Universite
structures.
L. Ershov,
(Yu.
Theory)
in Logic
York,
and
>v. 1,-Definabiility
L. Ershc
(RecursiveModel
Studies
sets
1975.
local
des Sciences
rings.
9 Avenue
Mirande.
Savary.
France.
Dijon,
E-mail:
rolinflu-bourgogne.fr.
Consider
equation,
Theorem
holds
and
definable
germs
This
is joint
ASGER
proof
work
that
of it are
under
composition,
Preparation
of analytic
functions.
We
not hold in the system of analytic
germs
does
Preparation
closed
if the Weierstrass
of the real field by the restricted
exponential
function.
Parusinski.
A descriptive
TORNQUIST,
functions
show
all elements
that Weierstrass
with Adam
We
division.
a ring then
in the expansion
of smooth
rings of germs
monomial
in such
from our
deduce
local
quasianalytic
implicit
set-theoretic
view of classification
in operator
problems
algebras.
Department
2100
E-mail:
Sciences,
the complexity
of recent
of classification
uses
that is. *-algebras
of operators
is often
as
described
5,
Universitetsparken
traditionally
and
large
space.
Hilbert
been
set theory
important
The
theory
The
theory".
spaces,
considered
to obtain
information
in the field of operator
that occur
measure
"noncommutative
they are built out of, has

in operator
on a Hilbert
that act on separable
algebras
of descriptive
problems
von Neumann
algebras.
specifically,
The von Neumann
form a certain
algebras
Neumann
of Copenhagen,
University
Denmark.
ku. dk.
asgertflmath.
talk will be an overview
This
about
of Mathematical
Copenhagen.
or more
one
algebras,
class
of operator
algebras,
of von
Neumann
algebras
problem
of classifying
specifically,
of the most
algebras.

von
the "factors"
important
problems
210
LOGIC
In the last decade,

the complexity
well
descriptive
of classification
known
is the application
'13
COLLOQUIUM
set theory
has been
used
problems
in many
areas
of these
ideas
as a natural
framework
of mathematics.
to classification
for studying
the most
Perhaps
in ergodic
problems
theory.
e-g. II]
there
Concurrently,
Neumann
of breakthroughs,
due
the connections
and
the von
This
about
the complexity
associated
algebras
Foreman
von
I will discuss
and
[2] M.
Lupini
and
Society
13] R.
Sasyk
and
of Functional
Notes
A.
. Borel
[5 ]
. Turbulence
[6 ]
. Turbulence
and
reducibility
School
Araki-
Woods
E-mail:
vladimirQias.
I will outline
which
sets,
are
Institute
univalent
groupoids.
the same
as
types
deduction
system
for
Sasyk.
measure
ergodic
vol.
Society,
6 (2004).
London
algebras.
pre
no. 3.
Mathe
pp. 363-396.
problem
von Neumann
for
factors.
no. 8, pp. 2710-2724.

of von Neumann
Journal
factors.
Araki-Woods
fuctors.
this Journal.
algebras,
of Functional
vol. 259
Analysis,
preprint.
of mathematics.
foundations
for Advanced
ideas
Study.
of the new approach
foundations.
or higher
groupoids.
homotopy
types.
and
homotopy
is
NJ 08540.
Princeton,
USA.
edu.
the main
we call
with Roman
theorem
classification
(2009).
Univalent
VOEVODSKY,
of Mathematics,
work
the news
is very high indeed.
von Neumann
(2012).
(2010). no. 9. pp. 2238-2252.

and free
and
classification
vol. 15 (2009). no. 2. pp. 169-183.
VLADIMIR
factors
years
information
quantitative
As this talk will show,
Mathematical
theory
The
vol. 256
and
factors.
of classifying
no. 406
Tornquist.
Analysis,
[4 ]
Set
Series,
actions,
group
has in recent
algebras
to obtain
An anti-classification
A. Tornquist.
Lecture
in understanding
Popa,
preserving
of von Neumann
Neumann
of von
a number
upon
actions.
techniques
of the European
pp. 277-292.
predicated
Sorin
algebraist
in this talk are joint
B. Weiss.
Journal
transformations.
has been
with such
set-theoretic
of classifying
of the structure
understanding
theory, e.g.. measure
of the structure
to use descriptive
of the results
[1] M.
Journal
of ergodic
as it turns out that the complexity
Many
matical
increased
understanding
part to the operator
understanding
it possible
serving
a greatly
the objects
Neumann
increased
been
in large
between
made
not good,
has
Part of this increased
algebras.
structures
of the
Therefore
of practical
and
objects
their
to Grothendieck's
According
on them.
univalent
to foundations
Mathematical
mathematics
Homotopy
foundations
allows
idea
theories,
one
higher
be considered
may
type
mathematics
form
equivalences
groupoids
as
studying
the underlying
to reason
about
formal
such
objects
directly.
Abstracts
of invited
talks
in the Special
Session
on
Computability
SAMSON
From
ABRAMSKY,
mechanics
quantum
to logic,
databases,
constraints,
and
complexity.
of Computer
Department
Science,
Oxford OX 1 3QD. UK.

E-mail:
samson.
classical
world-view.
for information
nonlocality.
ox.
abramskyOcs.
Mechanics
Quantum
presents
These
processing.
contextuality.
of Oxford.
University
Building,
Parks
of physical
reality
Road.
ac.uk.
a disturbingly
different
nonclassical
features
At the heart
of quantum
and
Wolfson
entanglement.
also
We shall
picture
offer new
resources
nonclassicality
describe
and
to the
possibilities
are the phenomena

of
work in which tools
recent
from Computer
Science
are used to shed new light on these phenomena.
This has led to a
number
of developments,
a novel approach
to classifying
including
multipartite
entangled
states, and a unifying principle
for Bell inequalities
based on logical consistency
conditions.
At the same
in classical
time, there are also

computer
science,
striking
including
and
unexpected
relational
connections
databases
and
with a number
constraint

of topics
satisfaction.
LOGIC
This
is ongoing
Lucien
Gottlob.
work,
Shane
Hardy.
Jouko
and
with
a number
Mansfield.
Rui
of collaborators
Soares
Lai.
Ray
Ahramsky.
[2] Samson
Ahramsky
and contextuality.
Relational
hidden
variables
Brandenisurger.
and
Adam
New
Journal
of Physics,
and
Lucien
Hardy.
Ahramsky
[4] Samson
Ahramsky.
and
local
International
G.
13 (2011).
Bell
francois.
Address',
URL
JEFFRY
and
functions
Department
L.
HIRST.
Dartmouth
URL
j lhflmath.
Address:
LIAFA.
URL
Sciences.
03755.
USA.
Boone.
University.
jlh/.
7014. 75205
7. Case
Paris
//www. liafa.univ-paris-diderot.f
http:
result
a DNR(2)
functions
relative
of Jockusch
[3] states
function
to every
but not
NC
28608
Cedex
13. France.
question
in reverse
2001
Meeting
of the American
Annual
the statement
"for
is "Are
question
[2], we show
Yang
+ BIj
result,
including
[1] Klaus
Comparing
no. 4. pp.
1089-1104.
[2] C. T. Chong.
weaker
principles
DNR
and
Methodology
1989,
AMlLCAR
pp.
of Science
Studies
in Logic
and
proof
over RCAo
+ 1^2.
of Chong.
and
Yang,
n | -conservation
in Mathematics,
with no fixed points.

(Jens
that
of this
colorings.
69
A.
(2004).
of combinatorial
vol. 230
(2012).
Methodology
Congress
Fenstad.
the Foundations
vol.
Logic,
International
Erik
Slaman.
Theodore
Logic,
Advances
be
Using
we show
of graph
Lempp.
The
can
a few extensions
of Symbolic
of the Eighth
(Moscow)
Jockusch's
mathematics
Ivan
of Logic,
T. Frolov
and
of Mathematics,
Extending
classical
logic for reasoning
Superior
Tecnico.
Universidade
Instituto
de Telecomunica<;5es.
E-mail.
of functions
Proceedings
denote
to X."
Specifically,
discuss
raises
at the
DNR(/c)
relative
[1] and
+ Bl2-
result
vol.
126.
191-201.
SERNADAS.
Matematica.
Yue
and
for pairs.
editors).
Hilpinen,
Elsevier.
Journal
theorem
Philosophy
Slaman
Steffen
The
A. Slaman.
Jr.. Degrees
equivalent
in the reverse
Theodore
VIII:
RCAo?"
We also
WKLo.
than Ramsey's
of Science
over
of DNR(2)
by Simpson
Let
is DNR(&)
and
function
DNR()
Jockusch's
Association.
Kjos-Hanssen.
WWKL.
and
RCAo,
that
WKLo
Lempp.
2. every
that the existence
first articulated
fails over RCAo
to a problem
Bjorn
no. 3. pp. 1060-1077.

G. Jockusch
[3] Carl
Philosophy
and
not prove
) does
Ambus-Spies.
over
perhaps
equivalent
Kjos-Hanssen.
an application
Slaman.
WKLo
that this equivalence
+ 3k DNR(A
RCAo
to WKLo
is a function
thus 3k DNR(&)
+ II2.
Given
Philosophical
there
k >
so.
uniformly
mathematics,
and
of Ambos-Spies.
techniques
3k DNR(fc)
in RCAo
formalized
set
every
r/'" pshafer/.
for every
that,
set is equivalent
an interesting
Dep.
the
Comparing
pshaferSliafa.univ-paris-diderot.fr.
Address:
Risto
of
2013.
edu.
appstate.
computes
and
sat
Proceedings
SHAFER.
NH
State
Appalachian
http://mathsci2.appstate.edu/'"
- Paris
Paris Diderot
A classical
and
A.
edu.
Universite
E-mail:
Hanover.
College.
USA.
E-mail:
constraint
editor).
Beijing.
PAUL
Review
Physical
functions.
g. doraisSdartmouth.
http://dorais.org.
of Mathematical
AND
101
of non
structure
Robust
Rossi,
(F.
(IJCAI).
Intelligence
DNR(2)
Kolaitis.
mechanics
vol.
113036.
pp.
inequalities.
Phokion
and
in quantum
on Artificial
of Mathematics.
Department
E-mail,
Georg
Logica.
The sheaf-theoretic
vol.
Logical
Gottlob.
variables
DORAIS.
o/ DNR(A:)
strength
Georg
hidden
Joint Conference
FRANCOIS
Kolaitis,
Sludia
andnonlocality.
vol. 85 (2012). pp. 062114.

isfaction
Brandenburger.
Phokion
Vaananen.
[1] Samson
[3] Samson
Adam
including
Barbosa.
(2013). no. 2. pp. 411-452.

locality
211
13
COLLOQUIUM
about
de Lisboa
quantum
and
SQIG.
systems.
lnstituto
Lisboa.
acsQmath.ist.utl.pt.
The
exogenous
modeling
and
quantum
reasoning
about
propositional
quantum
logic
systems,
(EQPL)
embodying
was
proposed
in [13,
all that is stated

14.
15] for
in the relevant
212
LOGIC
of quantum
postulates
from the semantics

models
as the models
of the proposed
on the lattice
of closed
by new
connectives
former
uses
superpositions
the classical
classical
language).
Furthermore,
ity reasoning
about
finite collections
and
computation
uations
is, not entangled

one
For example,
other
with)
assert
can
that some
impose
of classical
basis
val
of the Hilbert
systems.
of states
of such
a finite
are independent
qubits
of (that
can prescribe
the amplitudes
of a specific quantum
of a classical
outcome
after a projective
measurement
one can also
and,
is a superposition
qubit
to reason
in quantum
one
qubits;
basis;
for applications
of properties
range
for probabil
logic
is designed
EQPL
of the
amplitudes
classical
impose
constraints
on the admissible
states.
quantum
The
talk
structures
is focused
that the first order

work
More
used
fields
temporal
protocols
[2, 3. 4. 11].
Ahadi
J. Y. Halpern.
and
and
Information
[2] J. C.
Agudelo
to quantum
W.
[3] E. Ardeshir-Larijani.
protocols.
Construction
by relaxing
real
the semantic
closed
field
results
decidability
and
its
from the fact
a technique
using
vol.
A.
and
inspired
by
of Logic
and
no.
machines
vol.
and Analysis
on
Tools
Piterman
and
20
their
of
and
and
rela
no.
(2010),
checking
Equivalence
Conference
logics
1-36.
Computation,
R. Nagarajan.
of quantum
for first-order
1. pp.
Paraconsistent
and
the exogenous
namely
to the verification
expressiveness
112 (1994).
Carniclli.
S. J. Gay.
of the talk,
applications
of the 19th International
Proceedings
obtained
arbitrary
17],
[5.
at the end
Decidability
Journal
computing.
pp. 573-595.
spaces.
and
[12]
Computation,
and
The
is decidable
mentioned
logic
propositional
an
[1].
are
developments
quantum
[1] M.
of such
logic
over
spaces
of Hilbert
theory
of EQPL
fragment
product
instead
on probabilistic
recent
probability.
inner
[7];
are
closure
related
on a decidable
of EQPL
algebraic
tion
one can
about
in the computational
of the independent
a wide
the probability
over the computational
model
EQPL
of the
of the classical
are extensions
to the possible-worlds
expressed
product
in EQPL
extension
reasoning
Finally.
connectives
the semantics
languages
it is suitable
ap
[6], focuses
the classical
to a natural
logics.
therefore,
to a unit vector
to express
of qubits.
collection
quantum
and.
the mainstream
Neumann
while
quantitative
closer
In fact, each
information.
from the tensor
resulting
It is possible
state;
of qubits
that corresponds
allows
much
to the mainstream
von
replaces
as modal
(just
EQPL
from
and
operations,
leading
connectives
different
and
space
models,
in this respect
being
than
by Birkhoff
the lattice-theoretic
containing
probabilities,
is quite
proposed
of classical
designed
of classical
logic.
reasoning
of a Hilbert
subspaces
representing
language
space
quantum
EQPL
proach
was
starting
to quantum
approach
[8, 10]. The latter, as initially
The
and
for instance,
in [9, 16]). The logic
presented,
with the key idea of adopting
superpositions
(as
physics
upwards,
'13
COLLOQUIUM
2,
of quantum
for the
Algorithms
S. A. Smolka,
(Rome,
of Systems
editors),
Italy) (N.
in Computer
Science,
vol. 7795, Springer,
Berlin, 2013, pp. 478-492.
R. Chadha.
and P. Mateus.
tree logic:
Model
[4] P. Baltazar.
Quantum
computation
Lecture
Notes
and complete
checking
International
calculus.
Journal
of Quantum
Information,
vol. 6 (2008),
no. 2, pp. 219-236.

[5] S. Basu.
Berlin,
[6] G.
Birkhoff
vol.
ematics,
[7] R.
for
R. Pollack,
Chadha.
Quantum
[8] M.
Kluwer.
M.-F.
Roy.
Algorithms
in real algebraic
geometry.
Springer.
L.
Neumann.
quantum
(D.
logic
D.
Dordrecht,
The logic
of quantum
mechanics.
Annals
of Math
no. 4, pp. 823-843.
P. Mateus.
about
pp. 325-372.
J. von
and
37 (1936),
reasoning
tures:
and
2003.
Chiara.
The
[9] C. Cohen-Tannoudji,
New York, 1977.
A.
Sernadas.
systems.
K.
Gabbay,
R.
Giuntini.
Netherlands,
B
Diu.
and
Handbook
R.
Sernadas.
of quantum
and
Engesser
and
C.
D.
Lehmann.
Greechie.
Extending
logic
and
editors),
Reasoning
classical
quantum
Elsevier.
in quantum
logic
struc
2009,
theory.
2004.
and
F.
Laloe,
Quantum
Mechanics.

John
Wiley.
LOGIC
D.
[10]
J. Foulis.
Structures
The
1999,
Netherlands,
S. J. Gay.
[11]
systems.
quantum
editors),
F. M.
and
[14 ]
Intelligence
(Lisbon,
vol.
Science,
[15 ]
and
M.
[16]
A.
A.
[17]
automorphisms.
of T>t- Aui(Vt).
is to study
have
to a local
and
We
able,
base
and
information.
of
University
level,
degrees
and
with jump
94720
that
consequently
Ganchev
and
by 0,.'.
structure
role in this puzzle.
in the
degrees,
has
defin
of pairs
of structural
pairs
down
[2] brought
is still definable
In [1] Ganchev
of TOT.
the existence
of such
T>e.
degrees,
be embedded
we find that certain
reminiscent
the class
Soskova
bounded
the local
of the Turing
of the enumeration
[3] discovered
and
the automorphism
can
In Ve
rela
of
proper
a natural
first
he proved the first order definability

of the
obtained
a first order definition
of the total
that the notion
definability
a strong
by Slaman
of the structure
operation
properties
on this result,
reveal
operator
of the enumeration
degrees.
Kalimullin
T>t,
[7] to analyze
as a substructure
showing
that within
CA
rich is it algebraically:
how
it have nontrivial
degrees.
Woodin
enumeration
showed
0,.'.
of
Department
Berkeley.
in it; does
of the jump
the structure
be viewed
and
how
to the analysis
context,
degrees,
operator
above
and
3840,
definable
Turing
and
approach
proofs.
Building
showed
and
the total
Soskova
[5] showed
structure
investigated
are first order
degrees
set first by Rogers

Rozinas
the definition
in the local
[4], remains
that TOT
of
of
maximal
definable.
unanswered
is an automor
for V,..
adapt
show
logic.
degrees.
Bulgaria
Flail
its complexity:
definability
structural
of the global
question
seems to play a central
phism
We
natural
1164,
Evans
are first order
with
in
degrees
and
Artificial
propositional
geometry.
of the enumeration
JC-pairs,
Turing
jump
/C-pairs
and
Sofia
semi-lattice
thus can
more
enumeration
The
in
in Computer
and quantum
group
by Slaman
of the total
degrees.
the enumeration
Notes
quantum
algebra
Berkeley,
The
a richer
upper
and
TOT
enumeration
-pairs
as an
degrees,
the substructure
definition
Carnielli.
bg.
A different
it within
degrees
ties of generic
Logics
Blvd,
of the structure
used
group
enumeration
on
Lecture
computation
elementary
we study
relations
on a method
[6] relies
order
what
questions.
Shore
ability
ia.
structure
Investigations
results
for
of California,
all these
between
enumeration
editors).
of exogenous
Quantum
2000.
Bourchier
uni-sof
a degree
is its theory;
Turing
method
A.
no. 5, pp. 771-794.
(2006),
The automorphism
msoskovaSfmi.
degrees,
204
of Workshop
(W.
141-149.
pp.
J. Leite.
S. Gay.
pp. 239-251.
Cambridge,
University
To understand
tionship
2004.
I. L. Chuang.
5 James
FMI,
3840, USA.
The
and
and
Proceedings
Portugal)
Proceedings
systems.
axiomatization
vol.
A decision
The
complicated
Berlin.
Press,
1. SOSKOVA,
E-mail',
(J. Alferes
and
1951.
University,
Mathematics,
quantum
complete
Nielsen
Press.
MARIYA
about
logic.
(Lisbon,
2004.
DM1ST,
editors).
Mackie
(I.
pp. 389-413.
quantum
Applications
logics for reasoning
Temporal
computation
2012.
Exogenous
and
Theory
Computation,
checker for quantum
Aided
Verification
Computer
in Computer
Notes
Science,
C. Sernadas.
in quantum
Cambridge,
Sernadas.
Springer.
Tarski.
California
Press,
Portugal)
University
Cambridge
and
techniques
P. Mateus.
. Weakly
Information
Sofia
A.
Reasoning
3229,
Quantum
Dordrecht.
Kluwer,
A model
on
Lecture
editors),
A. Sernadas.
of Logics:
Dionisio.
we learned?
pp. 543-547.
Semantic
and
have
editors),
QMC:
Conference
S. Malik,
and
University
P. Mateus
on Combination
J. Pykacz.
N. Papanikolaou.
International
2008,
J. Ramos.
systems.
Cambridge
[13]
and
Gupta
Berlin.
P. Mateus.
[12]
about
(A.
Springer,
and
1-36.
pp.
of the 20th
USA)
5123,
Aerts
What
logic.
of quantum
(D.
of Reality
R. Nagarajan.
Proceedings
(Princeton,
vol.
A half-century
the Nature
and
213
'13
COLLOQUIUM
that
us one
framework
Woodin's
is at most
Aut{Vr)
that T>,, has
in T>e brings
and
Slaman
countable,
an automorphism
step
closer
base
to
that
its members
consisting
to the definability
the
investigate
of a single
of TOT,
properties
are
namely
of Aut(Ve).
arithmetically
element.
one
from it.

This
parameter
defin
analysis
away
214
LOGIC
This
was
research
SF
University
STRIDE
fellowship
No.
131/09.05.2012,
(298471)
within
[1] H. A. Ganchev
the enumeration
of Symbolic
[3] I. Sh.
[4] H.
Univ..
Rozinas.
Ivanovo.
[6] R.
Letters,
A.
Shore
of recursive
KAHLE.
P-2829-516
The
tions
current
Ivano.
{Russian).
Mathematical
jump.
in degree
Definability
talks
Gos.
Research
structures,
available
preprint,
2005.
pdf.
in the Special
Session
of Mathematical
Analysis
Classifying
on
Proofs
proofs.
FCT.
Universidade
of computer
this question
What
Nova
de Lisboa.
consolidating
distinctions
should
- allows
unveiling
into
account
relations
may serve different

of a theorem,
first proof
purposes.
its
uncovering
known to be true. Further

- is
for instance:
methodologically
already
a proof,
- uses new
(Hilbert),
of examples,
give rise to new considera
systems
that proofs
of theorems
whether
for generalizations
- shows
unexpected
unity (Poincare),
In addition
to the analysis
proof
proofsthe
proofs
proofsnew
take
assisted
is a proof?
into account
taking
to distinguish
truthfrom
concepts,
of "unrelated"
we will illustrate
a productive
capturing
areas,
etc.
our classification
with a discussion
are evaluated.
proofs
Research
McGraw-Hill
computability.
functions
the Turing
slaman/talks/sw.
the old question:
we propose
of how
Journal
degrees.
.uc.pt.
We will address
"pure",
in the enumeration
Recursive
Defining
of invited
developments
concerning
First
The
degrees.
Portugal.
Caparica.
kahleQmat
E-mail:
of
to appear.
of the enumeration
and effective
of e-degrees.
edu/~
de Matematica.
Departamento
in the structure
Society,
133-158.
operator
functions
W. H. Woodin.
and
berkeley.
Logical
REINHARD
outgoing
Programme.
pp. 711-722.
Abstracts
via Kalimullinpairs
Mathematical
structure
1, pp.
of the jump
pp. 71-84.
and T. A. Slaman.
[7] T. A. Slaman
//math.
no.
Framework
Community
1967.
York,
vol. 6 (1999).
at http:
in the local
by a Sofia
international
pp. 257-267.
The semi-lattice
1978,
03/07/12.12.2011.
Curie
Definability
77 (2012).
Definability
Jr. Theory
New
Company,
[5] M.
vol.
DMU
Marie
of the American
vol. 3 (2003).
Logic,
Rogers
I. Soskova.
and definability
Logic,
No.
by a
grant
and
the 7th European
Transactions
Kalimullin.
of Mathematical
Book
M.
and
degrees.
. Cupping
[2 ]
Journal
by a BNSF
supported
grant
'13
COLLOQUIUM
by the Portuguese
supported
in the Philosophy
of Mathematics.
Science
Foundations
FCT.
Hilbert's
projects
and
/2009,
PTDC/FIL-FCI/109991
The Notion
Legacy
of Math
ematical Proof. PTDC/MHC-FIL/5363/2012.

ALEXANDER
P. K.REUZER,
Laboratoire
d'ltalie.
69364
E-mail:
alexander.
URL
will
(on
Let
N).
finite type
//perso.
a method
present
(U)
Normale
to extract
Moreover,
of ACA0.
of proofs
that a nonprincipal
We
show
type
1 plus
iterated
This
tion and
let (Wldem) be the statement
(Widem) we can
Feferman's
Hindman's
program
extract
n)
and
theorem.
extraction
a term normalization.
46 Allee
fr/alexander.kreuzer/.
programs
that from
We also
technique
the a. so called,
idempotent
T
where
discuss
minimal
on a combination
idempotent
we will also
show
let ACAf"
(U)
one
can
be the
extract
is Ill-conservative
ultrafilter
recursion
over
-conservative
is based
If time permits,
and
that ACA'0U + (U)
in T\[p] (system
that this system is
ultrafilters
nonprincipal
exists,
in ACAq
proofs
a term
have
using
ultrafilter
on this we obtain
in Godel's
programs
system T. Based
over ACAq
and. with this, is conservative
over PA.
ACAq
de Lyon.
Superieure
f r.
ens-lyon.
be the statement
extension
and ultrafilters.
Ecole
07, France.
kreuzerens-lyon.
http:
extraction
du Parallelisme,
Cedex
Lyon
Address:
We
Program
de I'lnformatique
exists.
For
is restricted
ACAq
plus
to
the
ultrafilters.
of the functional
how
similar

interpreta
proof-theoretic
LOGIC
can
techniques
be applied
extraction
gram
to other
215
13
COLLOQUIUM
like Ramsey's
principles,
theorem
for pairs,
to obtain
pro
results.
P. Kreuzer.
[1] Alexander
.
[2 ]
On
ultrafilters,
Nonprincipal
Journal
reverse mathematics.
of Mathematical
in
ultrafilters
idempotent
extraction
program
vol.
Logic,
12 (2012).
reverse
higher-order
and higher order
no. 2.
mathematics,
preprint.
arXiv:1208.1424.
ALEXANDER
LE1TSCH.
University
E-mail.
leitschSlogic.at.
CERES
on
a
(cut-elimination
stepwise
clause
set
skeleton
with
useful
atomic
could
CERES
be used
is an
there
dant
w.r.t.
to identify
it can
CERES.
be
in a nonelementary
sult
CERES
has been
shown
the
proof
defined
(in
calculus);
on
that
use
sequent
clause
the
based
the cuts
y forms
a proof
gives
it is also
theoretical
versus
proofs
side.
sense,
cut-elimination
the other
[3]
with
proofs
is. in some
possible
of
automated
proofs:
the
the
proof
fast cut-elimination
reductive
and higher-order
charac
using
of an
large
admitting
cut-elimination
this is not
use
On
[4],
Given
the
a so-called
y then
of rather
versus
fact,
C(<p)
the
of cut-free
length
compression,
on
proofs
of proofs
reductive
into
projections
of CERES
for first-order
is not based
proof.
and
is constructed
CERES,
classes
is analyzed
in the
mathematical
new
bound
While
in a cut
every
proof
which
of the whole
analysis
in cut-elimination
to analyze
elementary
Moreover,
cut).
the
system
efficient
quite
tool
auxiliary
The
For
cuts.
Austria.
Vienna,
of cut-elimination
an
constructed
atomic
[1],
on
set of clauses,
be
plugging
cuts
rather
of <p ending
part
can
only
proved
prover.
asan
with
is defined:
tp(c)
only
theorem
(i.e..
y of C{ip)
of a proof
projection
S
the
a refutable
C{ip).
9. 1040
is a method
but
rules,
S.
sequent
of <p. a refutation
by CERES.
analysis
Favoritenstrasse
by resolution)
reduction
proof
ip of a
proof
teristic
Proof
of Technology.
Vienna
re
around
way
logic [5] and for various
redun
may
[2].
nonclassical
logics [3],
[1] M.
Journal
Baaz
and
A.
Cut-elimination
Leitsch.
and
[2 ]
of Symbolic
vol. 41 (2006), pp. 381-410.

. Methods
[3 ]
[4] M.
Baaz.
Fiirstenberg's
no. 2-3.
S. Hetzl.
of cut-elimination.
A. Leitsch.
C.
Trends
of the infinity of primes.
proof
in Logic,
Richter.
and
vol.
34. Springer.
H. Spohr.
Theoretical
Computation.
Berlin.
CERES:
Science,
Computer
2011.
An analysis
of
vol. 403
(2008).
Annals
of Pure
160-175.
pp.
[5] S. Hetzl.
A.
Leitsch.
D.
and
Weller.
in higher-order
CERES
and Applied Logic, vol. 162 (2011). pp. 1001-1034.

BENNO
by resolution.
redundancy-elimination
vol. 29 (2000).
of Symbolic
Computation,
pp. 149-176.
. Towards a clausal analysis of cut-elimination.
Journal
VAN
Universiteit
DEN
BERG.
Utrecht.
Afunctional
Mathematisch
for nonstandard
interpretation
Instituut.
P.O.
logic.
Box
NL.
80010,
arithmetic.
3508
TA
Utrecht.
The
Netherlands.
E-mail.
B.vandenBerglQuu.nl.
Inspired
tions
one
by Nelson's
for systems
to prove
terms
This
work
the conservativity
from nonstandard
is joint
work
[1] Edward
Set Theory
arithmetic,
both
of nonstandard
[1. 2], we define functional

classical
and constructive.
systems
over
standard
ones
interpreta
This allows
and
to extract
proofs.
with Eyvind
Nelson.
of the American
121
on Internal
for nonstandard
Internal
Mathematical
. The syntax
Briseid
and
set theory:
vol.
Society,
of nonstandard
Pavol
Safarik.
a new approach
83 (1977).
analysis.
to nonstandard
no. 6, pp.
Annals
of Pure
Pavol
Safarik.
Bulletin
analysis.
1165-1198.
and Applied
Logic,
vol. 38
(1988). no. 2. pp. 123-134.

[3] Benno
van
tion for nonstandard
pp. 1962-1994.
den
Beru.
arithmetic.
Eyvind
Annals
Briseid
of Pure
and
and
Applied
Logic,
A functional
vol

163
interpreta
(2012),
no.
12,
216
LOGIC
of invited
Abstracts
HANNES
DIENER.
Department
E-mail:
dienerQmath.
The
of constructive
of functions
constructive
varieties
varieties
to break
in Bishop's
system
continuous;
he simply
of results,
function.
Among
|f{xn)
decision
a priori
In this talk
BRUNO
without
we are
DINIS.
to have
[5], most
a neutrix)
under
structures
framework
intuitionism,
R
> R
continuous.
are
One
there
However,
is
on the
assumption
let
be a sequence
numbers
positive
<
either
p.
> a infinitelyoften.
sequential
all functions
which
continuity;
of similar
results,
is. of course,
that we can
surprising
are continuous
with individualized
It was
shown
of external
are external
neutral
make
this
or not.
that sometimes
showing
elements.
may
some
semigroups.
inverse
elements
which
under
numbers
are totally
property
to those
[2] [3] [7]. Hence

of real numbers.
by axiomatic
rules.
that ordered
[1] I. P van
This
den
Springer-Verlag,
fields
satisfy
Berg.
even
numbers
Nonstandard
and
and
supremum
be
may
of orders
are models
with addition
It was
also
be completely
allowing
have
shown
of
and
the class
that the distributive
characterized.
for a sort
algebraic
of common
in common
Moreover,
of generalized
have to a large extent
structures
satisfy
set of all infinitesimals
(the sum of a real number
therefore
equipped
the introduction
symmetric
all axioms
Berlin,
numbers
multiplication.
justifies
These
and
and
[6] [7].
as HST
with multiplication
form commutative
equipped
external
numbers
have individualized
neutral and
that can
ordered,
external
neutral
numbers
and
restrictions
some
with individualized
of external
real numbers,
addition
infimum
such
boundaries.
are not neutrices
Unlike
for both
an
or translations,
neutrices
elements,
numbers
it pos
making
are called
nonstandard
External
having
is admitted,
groups
are the external
examples
without
additions
with imprecise
external
We show
Simple
Such
sets have
real numbers.
in [4] that the class
regular
of external
all infinite
be bounded
at least
of infinitesimals
of R.
subgroups
sets.
set of all limited
numbers
is valid
the existence
convex
in which
or transitions
magnitude
1249.
and
a variety
were
Bishop
Portugal.
approach
neutrices
invariant
defined
to present
different
many
the external
law
mapping,
Since
functions
with
The
consequence.
bdinis3isegi.unl.pt.
In an axiomatic
with
trick:
decide
all
In some
philosophical
(B1SH).
any continuity
second
for all
(with
this situation.
It is. however,
whether
knowing
Algebraic
In the nonstandard
and
Then
are continuous.
going
Lisboa,
ISEGI-UNL,
sible
x.
on
of many
is overrated.
continuity
E-mail:
much
not make
in particular
feature
or Brouwer's
that
he worked
that do
that we can
saying
if all functions
Germany.
are continuous.
mathematics
functions
extensional
functions
disprovable
Ishihara's
bizarre
it is a proven
< p eventually or \f(xn) /(x)|
that this is almost
not surprising
for example,
to continuity,
mathematics
to improve
in BISH,
to a limit
f{x)|
linked
models
nor
all
that
R > R be a strongly
Let /:
recursive
to either classical
possible
provable
Siegen.
in as an axiom
built
style constructive
provable
assumed
them,
are closely
this comes
as
compatibility
in R converging
Notice
such
it is neither
that it is not
assume
a group
Str. 3, 57072
for the uninitiated,
A,
is that often all such
in Bishop
subtle
did not want
might
R.
intuitionism
in others,
is a bit more
situation
of mathematics
whereas
backing),
sometimes).
Walter-Flex
mathematics
of type
as Brouwer's
such
on
de.
uni-siegen.
foundations
continuity
(...
of Siegen,
University
Session
and Analysis
is overrated
Continuity
Mathematik,
in the Special
talks
Logic
13
COLLOQUIUM
the
completeness
properties
algebraic
the fact of being
similar
structures
semigroups
elements.
all the axioms
with two exceptions
and
that the class
presented.
asymptotic
analysis.
Lecture
Notes
1987.

in Mathematics
LOGIC
[2] I. P. van
don
Berg
nonstandard.
analyse
(1981). pp. 501-504.

[3] I
van
G.
Summary
der
Report.
[4] B. Dinis
Corput.
I. P. van
and
M.
in Mathematics,
graphs
[6] F. Koudjeti.
Ph.D.
thesis,
ISAAC
Reeken.
and
de Robinson
Serie
Paris,
distributions.
en
I. vol.
MRC
293
Tecnical
properties
of external
numbers.
Analysis,
axiomatically.
Journal
of
1-30.
Nonstandard
Analysis
Berg.
and
IJssel.
a/d
M.
Diener.
Mono
Springer
and
Offices
Engineering
numbers
uniform
calculus.
1995.
Universitext,
groups.
851
249),
finance.
1995.
and external
Springer
Science,
Computer
(M/C
to mathematical
Netherlands.
editors),
hulls of locally
Statistics,
The
external
Neutrices,
(F. and
Nonstandard
with an application
calculus
Capelle
den
in Practice
IL 60607-7045 USA.
of Illinois
University
South
Street,
Morgan
at
Chicago.
isaacfimath.uic.edu.
E-mail,
In this talk, we show

a uniform
how
near the identity.
will discuss
such
Nonstandard
of Mathematics
and
analysis
and CM
iterative fixed
of Oslo.
A, University
for Banach-Lie
point
Box
We
group.
of defining
free from small
uniformly
hull of
uniformly
a local
on the choice
hull construction
of groups
are
operations
hull is naturally
hull depends
nonstandard
theory
of the nonstandard
whose
group
the nonstandard
the nonstandard
with Pestov's
LINDSTR0M,
Department
construction
Luxembourg's
of a topological
In this case,
with Enflo's
the connection
TOM
case
as how
topics
the relation
dometrics,
to adapt
to the special
space
continuous
and
neutrices
Algebraic
of external
I. P. van
and
Science
de Sciences,
1960.
no. 9, pp.
of Mathematics.
Chicago,
Berg.
publications.
GOLDBRING.
Department
calculus,
den
Elements
[7] F. Koudjeti
pp. 145-170.
Neutrix
clu lemme
applications
I'Acudemie
2004.
Labyrinth
Nonstandard
Diverses
de
vol. 3 (2011).
[5] V. Kanovei
Diener.
Rendus
of Wisconsin.
University
and
and Analysis,
Loîc
M.
and
Comptes
217
'13
COLLOQUIUM
pseu
groups,
subgroups.
methods.
1053
Blindern.
N-03160slo.
space,
a contraction
Norway.
lindstroQmath.
E-mail:
Banach's
uio.
Point
Fixed
no.
T always
has a unique
fixed point
Banach's
theorem
been
been
a continued
interest
contractive
but where
talk.
has
I shall
show
which
in asymptotic
in a complete
be obtained
directions,
can
and
from any initial

in recent
on high
be used
to simplify,
a contraction,
T"
iterates
point.
there has
years
T is not necessarily
put asymptotically
methods
metric
by iteration
where
versions
are
nonstandard
that
can
in different
generalized
conditions
how
states
Theorem
of T.
unify, and
In this
extend
these
results.
The
talk is based
on joint
work
Abstracts
with David
of invited
A. Ross,
talks
Model
ARTEM
Institute
Campus.
E-mail',
Givat
art.
of
Ram.
Jerusalem,
by 2".
theoretic
some
of sets have
(or
to depend
and
equalities
of Jerusalem.
Edmond
J. Safra
Israel.
of the number
on
the model
inequalities,
These
closed
true that k <

both
ded{n)
of Dedekind
and
are
theories
important
valued
class
fields and
cuts a linear
that ded(n)
is bounded
of set theory
one
is working
consistently
and
in ZFC.
from the fact that it describes
comes
theories.
algebraically
on
cuts.
University
be the supremum
finite VC-dimensionan
but also
of Dedekind
it is always
of ded(n)
NIP)
Session
com.
While
seems
new
importance
of dependent
theories,
else
everything
I will present
91904,
k, we let ded(n)
of size k may have.
in the Special
Theory
Hebrew
Mathematics,
chernikovSgmail.
For a cardinal
order
On the number
CHERNIKOV.
Einstein
of Hawaii.
University
in which
containing
p-adics.
the size
uniformly
both
of type-spaces
definable
stable
and
families
o-minimal
I will give applications

with.
Model
of the
218
LOGIC
new bounds
on ded{n)
[1] James E.
Annals
[2] Artem
invariant
in
types
Shelah.
the dense
sets,
and
to counting
set problem
and
the partition
no. 4. pp. 401-439.
Saharon
Shelah.
On nonforking
sub
spectra,
1205.3101.
[3] Artem
and
Chernikov
preprint.
[4] William
Annals
Kaplan,
and
Saharon
vol. 9 (1976),
Logic,
Itay
Chernikov.
and
Almost-disjoint
of Mathematical
arXiv:
mitted,
transfer
with Itay Kaplan
Baumgartnlr.
calculus.
model
to the two-cardinal
Joint work
theories.
dependent
'13
COLLOQUIUM
Mitchell.
Saharon
Shelah.
trees
Aronszajn
of Mathematical
vol.
Logic,
and
the independence
5 (1972/73),
of the transfer
property.
pp. 21-46.
mod
theory and the number of nonisomorphic
SHELAH.tnqinsertClassification
[5] Saharon
in Logic and the Foundations
of Mathematics,
vol. 92. North-Holland
Publishing
New York, 1978, pp. xvi+544
.
Amsterdam.
Company.
els. Studies
ITAY
The Borel
KAPLAN,
Mathematisches
E-mail,
Institut.
itay.
invariant
of) the monster
Aut ().
invariant
relations.
equivalence
62 48149
Minister.
an equivalence
relation
Einsteinstrasse
Miinster,
Germany.
kaplanffluni-muenster.de.
By a hounded
power
of hounded
cardinality
Universitat
These
relations
we mean
relation,
equivalence
model
which
has strictly less than
are often encountered
|C| classes
in model
studied
and
on
(some
is invariant
and
An
theory.
under
important
the finest such relation.

is =c
of Lascar
Another
strong types
example
equality
is the quotient
for a definable
or type-definable
group G.
G/Gm
In descriptive
Borel equivalence
relations
set theory, the study of classifying
up to Borel
example
X and
to X'
X',
such
that xEy
<*==>
reducible
to Ay
In [2], the authors

able
language)
interpret
Stone
In joint
work with Pierre
[1] Itay
strong
as the ones
Kaplan.
types,
Benjamin
TAMARA
strong
SERVI,
equivalence
relations
on Polish
to a Borel
and
spaces
f from X
relations
which
are smooth.
There
(in a count
is a natural
equivalence
hence
map
relations
equivalence
set theory.
model,
E'
it makes
relation
sense
to
way
on
the
to ask where
reducibility.
Miller
also
about
talk
[1] we showed
other
that =*. is either closed
bounded
invariant
equivalence
actions.
and
Pierre
Simon.
The
Borel
cardinality
of Lascar
1301.1197.
Krupinski.
lascar
and
Borel
invariant
Benjamin
Miller,
E and
if there is a Borel
equivalence
relation
by group
in arXiv,
preprint
[2] Krzysztof
relations
and
this and
induced
X.
of descriptive
of Borel
Simon
I will discuss
such
bounded
over a countable
types
to E'
Closed
equivalence
in the quasi-order
or nonsmooth.
relations
viewing
invariant
of complete
space
is this relation
smooth.
the framework
through
relations
reducible
for all x,y
J (x)E'f(y)
are called
suggested
a bounded
two equivalence
we say that E is Borel
respectively,
are Borel
Given
is very extensive.
bi-reducibility
Anand
Pillay.
types, preprint
elimination
Quantifier
and
Slawomir
in arXiv,
Solecki.
Borel
equivalence
1204.3485.
and preparation
theorem
for generalised
quasiana
lytic algebras.
CMAF-UL.
E-mail:
Avenida
A generalized
whose
Professor
support
power series (in several

is contained
in a cartesian
An of real
germs
in n variables
morphism
variables.
which
associates
In the context
2, 1649-003
Lisboa.
I proved
Quantifier
Portugal.
Elimination
key tools
Noetherianity
used
Theorem
germ
a formal
algebras,
with J.-P. Rolin)
in the proof
of the two above

power
series
and
if there
algebra
quasianalytic
in A
in [2] and an analog
of the ring of formal
with real nonnegative

subsets of R-.
of well-ordered
product
quasi-analytic
(in collaboration
in [3, 5, 6],
is a series
variables)
is a generalised
to every
of generalized
geometry.
The
Pinto
Gama
tamara.servifigmail.com.
generalised
which
extends
exponents
An algebra
is an injective
power
series
in n
that of real analytic
an analog
to Denef and van de Dries'
Theorem
to the Subanalytic
Preparation
results
in the real
the Weierstrass
analytic
Preparation

case
are the
Theorem.
LOGIC
Both
such
suitable
are not available
tools
version
in the generalised
of singularities
of the resolution
219
13
COLLOQUIUM
an o-minimal
we use a
Instead,
setting.
quasianalyitc
in [1] and
theorem
preparation
in [4],
[1] E. Bierstone
Etudes
P. D. Milman.
and
Publications
Scientifiques,
[2] J. DnNCFand
Semianalytic
L. van hen Dries.
[3] L.
van
restricted
den
A.
Dries.
Macintyre.
pp. 183-205.
D.
and
with exponentiation.
fields
analytic
Annuls
des Hautes
pp. 5-42.
and real .subanalytic
p-Adic
vol. 128 (1988). no. 1. pp. 79-138.
sets. Institut
andsubanalytic
1988.
Mathematiques.
sets. Annals
Marker.
The
of Mathematics.
elementary
of Mathematics,
vol.
140
theory
of
no.
(1994).
1.
O-minimal
and P. Speisseguer.
theorems. Model
preparation
theory
[4] L. van den Dries
vol. 11. Aracne.
Rome.
2002. pp. 87-116.
and applications.
di Matematica.
Quaderni
Thereme
de preparation
logarithmico
pour les fonctions
[5] J.-M. Lion and J.-P. Rolin.
de
Annales
exponentielles.
I'lnstitut
Fourier
vol.
{Grenoble),
47
no.
(1997).
3.
pp. 859-884.
[6] A. Parusinski.
in singularity
On the preparation
Siersma
(D.
2001.
Netherlands,
MARGARET
et al..
E. M. THOMAS.
Algebraic
Pila
10. D-78457
Wilkie's
influential
the transcendental
the real exponential

in a wider
definable
and
show
how
class
results
This
years
proven
O.
Jones
and
[2] D.
Masser.
Rational
values
E.
M.
[3] J. Pila
vol.
A.
and
J. Wilkie.
133 (2006).
of the Riemann
The
of rational
of the real field.
between
of curves
lying on
points
and
o-minimality
rational
of algebraic
Thomas.
Journal
This
result
diophantine
to their result for Kexp,

and certain surfaces
The
points
density
of Mathematics,
zeta function.
vol. 131 (2011), no. 11. pp. 2037-2046.

Journal,
the density
these results
Kexp (see [1]). We will explain
with a proposition
be combined
of Masser
([2]) to
Quarterly
pp. 637-651.
Konstanz,
including
can
Margaret
The
surfaces.
Pfaffian
Universitaet
expansions
in the case
a question
of Masser
the density
concerning
zeta functions.
lying on the graphs of Weierstrass
O. Jones.
This is joint work with Gareth
[1] Gareth
zeta functions.
216.
an improvement
conjectured
been
of structures
of this kind
Fach
in o-minimal
also
has
Weierstrass
answer
on certain
The
org.
in recent
Wilkie
paper.
field.
and
of [3] bounds
a lively interaction
In the same
geometry.
Developments
Dordrecht.
Publisher,
Germany.
oxon.
theorem
of sets definable
parts
about
has brought
und
Konstanz.
thomasQwolfson.
margaret.
and
New
functions.
Academic
Statistik.
points
Mathematik
Zukunftskolleg/Fachbereich
E-mail:
Kluwer
193-215.
pp.
UniversitaetsstraBe
theorem for subanalytic
editors).
points
vol.
Journal
of a definable
set.
of bounded
degree
of algebraic
points
63
of Number
Duke
no.
(2012),
3.
Theory.
Mathematical
no. 3. pp. 591-616.
Abstracts
of invited
in the Special
talks
on
Session
Set Theory
DAVID
ASPERO.
University
E-mail.
The
together
happen
Anglia.
Norwich
Research
Park.
Norwich
NR4
7TJ, UK.
d.asperoQuea.ac.uk.
real numbers
with
when
indecomposable
will be focused
This
reals.
Long
of East
is joint
addition
we replace,
ordinal
mostly
work
in a natural
are constructed
ordinary
way from (a>, +, ) (i.e..
and
multiplication).
in that construction,
(a;.
and
, denote
on the case
in progress
when
I will
+, ) with
Hessenberg
a has countable
with Kostas
addition
show
some
(a,,),
and
the natural
where
multiplication.
cofinality.
Tsaprounis.

numbers
of the things
a
>
that
w is an
The
talk
220
LOGIC
BENJAMIN
MILLER
AND
13
COLLOQUIUM
CLINTON
CONLEY,
Projective
and
rigidity
definable
cardinality.
Institut
fiir Mathematische
E-mail:
URL
ben.
und Grundlagenforschung.
Logik
62, 48149
EinsteinstraBe
Informatik,
Miinster,
Address:
URL
http://www.math.uni-muenster.de/u/ben.miller/.
of Mathematics,
clintoncQmath.
Address:
310
Malott
Cornell
Hall,
Cornell.
of SL2(Z)
action
NY
Ithaca,
University,
14853-4201.
edu.
http://www.math.cornell.edu/~clintonc.
the use of a strong
recent results concerning
We discuss
usual
und
Germany.
USA.
E-mail:
Mathematik
de.
millerQuni-muenster.
Department
Fachbereich
on T2 to discern
the structure
projective
rigidity
of the definable
of the
property
cardinal
hierarchy
just
beyond R/Q.
CHARLES
Combinatorics
MORGAN,
at
cardinals
singular
of any
and
cofinality
their
successors.
UEA,
talk will discuss
Organization
some
Saturation
Science
saturation
We have
two
the other
1.
ideals
Under
The nonstationary
2.
{x G VK/.: ot(x)
The nonstationary
3.
{.x e VKk: xfl/ig

The nonstationary
The weakly
can
ones,
main
for proving
Rokko-dai
University,
large cardinal
ideal
1-1, Nada.
weakly
The
we will see that
embedding
ideals
compact
is collapsing
argument:
can be saturated:
A). where X is regular
and
S(k,
A) =
in sup(x)}.
to T(, /), where A is singular
and
T(k,
A) =
to S{n,
restricted
over V(un)
ideal
restricted
C k:
{X
/u x}.
to some stationary
regular
X is not n J-indescribable
subset
of {x
a>2:
in VK } over k. where k is
compact.
club
ideal
guessing
restricted
to the regular
C k : X does not carry club guessing

{X
cardinals,
where k is totally indescribable.
Abstracts
A. NAIT
One
In this talk
the following
on ideals
set, weakly
properties:
embedding.
assumptions,
h) for every large
ideal
strong
our interests
over some
and x is stationary
over
S(k,
We focus
ideal
by lifting an elementary
over VK/. restricted
ideal
topic.
with
an ideal
be saturated
is regular
compact
is an important
is lifting an elementary
certain
1.
over
talks
of contributed
On the logical
ABDALLAH,
sequences}
formalization
of interaction-free
measurements
in
mechanics.
quantum
Department
E-mail:
The
Kobe
e.g., the nonstationary
sense,
ot(x) = cui}.
M.
The
cardinals.
older
ideals.
Technology.
to construct
ways
nice definable
Theorem
of ideals
in some
and
cardinal,
various
some
usubapeople.kobe-u.ac.jp.
Set theory,
ideals.
5.
and
of its use.
of definable
and
at singular
ideas
Japan.
are definable
4.
new
blending
of examples
USUBA.
which
large
in combinatorics
developments
framework,
of Advanced
657-8501
E-mail:
and
results,
TOSHIMICHI
On
recent
will be on a general
consistency
Kobe,
7TJ, UK.
charles.uea0gmail.com.
The
focus
NR4
Norwich.
E-mail:
of Computer
Science,
inria.
areskiSyquem.
Elitzur-Vaidman
an object
that interacts
it. In this method,

is inserted
within
the interferometer,
UWO,
London.
GedankenExperiment
with other
the likely
systems
"container"
a Mach-Zehnder
is used
Canada;
INRIA.
Rocquencourt,
France.
f r.
to observe
solely
mechanical
method
to find
[1] is a quantum
via its self-destruction
without
destroying
of the object
interferometer.
the classical
to be discovered
A quantum
object,
(a photon
the photon
object.

detector)
traversing
LOGIC
We
apply
physical
Curry-Howard
a lambda-calculus
and
The
experiment
T =
{x : e.
with phase
->k,
(P.
a'
->
(J, +rc) : > a',
b\,
c'*
N : bt ^
->
R:
f'.
T:
B,
measurement
->
rules
k ^
Ob.Ocd
given
The
0, i + 2 / 0."
case(z;
context
S:
C,
d V d'
E \ B ->
b2.
by
->&
{Ob:
q.
Ai
>
Solving
Problem
F,
Ore:
(CSP)
+ .') + ({{' = 0. 6 ^ 0 =>
inhabitation
yields
Constraint
= 0,
63)
6)
->
-.fc ->
:/*, {{': /'*, tf: c"},
conditional
given by: "if then (f2f{ + i3')(i{{'

0, {, + fc # 0. else if -<k then
0, <î^2 =
[2]
hi > b',
(J1, +n):
&:/>*.
with the associated
together
F},
information
d. P": a' >d'* >d',
c V c'
B ^
{,:a\
with
of the quantum
of partial
e a* > a,
+n):
(P1, +n): b' >c* >c, Q': b' >d*

Q":
formalization
on the logic
by context:
e >/>!*>
Q:
a logical
It is based
/.-terms.
is formalized
z\k\l
to give
isomorphism
this experiment.
underlying
process
221
'13
COLLOQUIUM
^
^
claims:
+ R(m2(P'(J'(T(N(Qx{2))u))Z\));
lu.R(inl(Q"(J(Pxtl)){'2'))
Xv.R(ml{Q"(J(Px(l))^))):
cas;e(z; AM.S(in,(P"(./U>*i))r))+ <S(in2(e'(J'( WG^))"))#)).
tt);
^.SGn, (/>"(/(/>*,
))('))): D
?.u.0; kv.E{N{Qx,2))v)\
case(z;
which
are
the
symbolic
mechanics
quantum
substitutions,
holds,
The
of which
makes
one
only
to the physical
corresponding
interference"
detector
interferometer
[1] A. C.
Foundations
and
D.
and
of Physics,
in Theoretical
BAHAREH
AND
three solution
in the case
on
where
->k
at "destructive
registers
present
mechanical
Quantum
the lower
of the
path
measurements.
interaction-free
pp. 987-997.
The logic of partial

Science.
AFSHARI
nonzero
the photon
in the standard
yields
destroyed.
23 (1993),
Aisdallah.
Computer
equations
of D
is both
to be found
used
amplitudes
of the CSP
the amplitude
L. Vaidman.
vol.
probability
resolution
fact that whenever
the object
has not been
Elitzur
[2] M. A. Nait
of the
counterpart
formalization.
EATCS
information.
1995.
Research
Monographs
Berlin,
Springer,
GRAHAM
E.
LEIGH,
On
closure
of Oxford.
Parks
ordinals
for
the modal
mu-calculus.
of Computer
Science.
University
Department
bahareh.
af shariScs.
ox. ac. uk.
Road.
Oxford
OX 1 3QD,
UK.
E-mail',
of Philosophy,
Faculty
E-mail,
graham.
The
defining
calculus
ordinal
which
arising
I2
k such
ordinals
of modal
positive
across
logic
such
all
existence
constituents
by 0.
The
that juX<p has
closure
closure
fragment
ordinal
of modal
In this logic,
by u>2.
of tableaux,
trees generated
of Schiitte
ordinal
(finite
It is known
are bounded
in the manner
is the expression
of the formula
structures
Kripke
ordinals.
from the alternation-free
ft n2)
Oxford
OX2
6GG.
UK.
of fixpoints.
In
uk.
mu-calculus
that the denotation
are closure
Road.
Woodstock
ox. ac.
this
with a least fixpoint quantifier

logic is extended
n that can apply
in X. The new formula is then interpreted
as the least fixpoint of
induced
operator
coincide
operator
of modal
4>{X)
the monotone
least
leighfflphilosophy.
feature of the modal
the syntax
to a formula
of Oxford.
University
a formula,
or infinite).
[1].
mu-calculus
by systematically
chains.
The
a
<
We prove
can
if it exists,
the K-th iteration
that for every
satisfaction
deduction
of such
and
that the closure
(the syntactic
To
addressed
question
down
obtain
is
a>2 there is a formula
be characterised
breaking
is the
of the induced

class capturing
in terms of the
formulae
optimal
<p
ordinals
upper
into
their
bounds
222
LOGIC
we utilize
the connection
the corresponding
between
OLGA
How
science
de
of formulae
Institut
in modal
Brno.
editor),
On Dedekind's
Philosophic.
and
embedded
of
order-types
extensional
Republic,
Fixed
points
pp. 35-39.
2010,
logicism.
de
Catholique
be reached?
p.-calculus
Czech
Toulouse.
31
rue
de
la
31068
Fonderie,
France.
Toulouse,
E-mail'.
com.
olgaantonova73<Sgmail.
there are many
Actually
in the sense
logicism
logicism.
Dedekind's
conception
talk is to compare
Other
about
Dedekind's
Dedekind's
conception
is a variant
two theories
that have
and
(by Frege
between
such
logicism
logicism
that the traditional
theories
of traditional
and the relations

logicism
of arithmetic.
According
of traditional
think
logicians
are different
is not a variant
some
and
Dedekind)
but a theory
logicism
of logicism
conception
common
The
points.
demonstrate
of distinct
to some
as Frege's
aim
and
of this
that Dedekind's
type that can
be named
logicism.
Dedekind
and
arithmetic
understand
Frege
is a part
foundation
notions
and
conception
or Russell's
extensional
discussions
of Frege
Dedekind's
logicians
theory
ordinals
fast can the fixpoints
Santocanale,
(L.
ANTONOVA,
Faculte
closure
tableaux.
[1] M. Czarnecki.
in computer
13
COLLOQUIUM
of logic
of arithmetic
of object,
of arithmetic's
system,
the concepts
[1] Jean-Pierre
Logic
and
La
NIKOLAY
de nombre
So
a theory
(a thing)
chez
is intensional.
is a logicist
logicist
Dedekind,
Frege
for example,
concepts,
his theory
traditional
Intuition:
against
Rigor,
et al., editors),
theory
theory.
Cantor,
Theories,
Frege:
of thought:
A history
and
Scope,
Cambridge
of set theory
the Motives
Scholars
and
of his
Publishing,
its role in modern
1999.
On computable
BAZHENOV,
of Frege's
Cellucci
(C.
Labyrinth
Birkhauser.
he creates
1996.
Dedekind
Knowledge
[3] Josfi Ferreiros.
i.e.. the
on the logical
of our thought
theory
the extensional
to a thing".
belongs
Notion
Cambridge, 2011. pp. 205-217.

mathematics.
in particularly
thing
Vrin,
Detlefsen.
and
notions
as an object
of Frege's
the character
theory
"a
Belna.
[2] Michael
Logicism.
and
etphilosophic.
of thought,
is based
theory
of these
a system
to Dedekind
According
on the laws
Dedekind's
the grounds
considers
but not in the sense
logicism)
conceptions,
On
differently.
is based
by its elements.
approach
"system"
(extensional
function.
to Dedekind's
Dedekind's
of thought.
Dedekind
determined
In opposition
criticizes
and
of logic
the arithmetic
is the laws
foundation.
that is completely
the notion
because
enumerations
of Boolean
algebras
with distinguished
endomorphisms.
Sobolev
Institute
E-mail:
of Mathematics
/. e
Hereafter
An
,-algebras.
with distinguished
algebra
for Boolean
language
u>.
algebras
we will call
extended
enumeration
of
enumeration
(2l)6w
is A,-computable
for the structures
indices
(2)
There
(1)
There
exists
is no computable
exists
operations
by [
/o, /1,...,
the class
a number
fx,
where
of all computable
of computable
(2U)e(
of the stan
-algebras
n such
if, for every
that is computably
n / m. 21 A<> 2l,. An
a A,-computable
sequence
of com
2l.
computable
Ex-algebras
tree. We obtain
the following
results:
1.
Friedberg
if there
[1, 2] we use the technique
characterize
Theorem
avenue.
Koptyug
as a structure
endomorphisms
0 is a sequence
Ai
there exists
that for any computable

E>-algebra
to 2l. An enumeration
is called
isomorphic
Following
4 Acad.
University,
by unary
We denote
it E,-aIgebra.
such
putable
State
ru.
nickbazhfiyandex.
We treat a Boolean
dard
and Novosibirsk
Russia.
Novosibirsk,
of generating
we introduce
a A-computable
enumeration
of [/^
trees for Boolean

the notion
enumeration
algebras.
of E-mapping
of \.
4|
0.
^1

In order
for a generating
to
LOGIC
a A-computable
(3)
There
exists
(4)
There
is no A-computable
This
RF
work
was
the Federal
the years
Aid
Grant
Target
2009-2013
Algebra
Logic.
Boolean
BIENVENU.
SHAFER.
LIAFA.
Paris
Universite
RUPERT
Institut
fur Theoretische
Informatik.
der
and
r8hoelzl.fr.
I -algebras.
CHRISTOPHER
7. Case
7014.
Mathematik
Bundeswehr
75205
und
Miinchen.
Cedex
Paris
- Paris
Diderot
7. Case
7014.
75205
Paris
Christopher.
p. porterQgmail.
E-mail:
pshaferQliafa.
fr.
univ-paris-diderot.
randomness
for various
probability
there
and noncomputable
measures),
Martin-Lof
Although
(for both
computable
randomness
Martin-Lof
with
as a defective
probability
some
ongoing
work
Lof
randomness
with
a definition,
weaknesses
measure
it need
(as
how
not
of providing
where
Cedex
and
LUDOVIC
E-mail,
pshaferQliafa.univ-paris-diderot.fr.
E-mail',
ludovic.patey<5computability.
AND
in reverse
if when
picking
a sequence
reals
which
are
that M is a model
probability
We provide
a classification
in terms
of the NRA
in the zoo.
(RRTj)
implies
of Erdos
of Martin
a
equivalently.
several
as well as the relative
candidates
strengths
for
and
PAUL
SHAFER.
Reverse
Cedex
mathematics:
13. France.
mathematics
of X,
has
the no randomized
at random,
from
computable
and
some
algorithm
(NRA)
M
the co-model
considering
finite join
of the
of the current
reverse
Athen
the
of P is zero.
of almost
property
every
principle
by providing
proofs
of NRA
property
mathematics
for very weak
This
results like rainbow

theorem for
easy separation
Ramsey
provides
neither the stable version of thin set for pairs (STS(2))
nor the stable
Moser
BLASIO.
I will discuss
definition
(or
of
be seen
fr.
studied
of the
can
fr.
bienvenuQcomputability.
consisting
definition
In this talk.
useful
semimeasure
to another,
PATEY.
laurent.
A principle
is wellunderstood
definition.
E-mail',
theorem
CARLOS
(SEM).
CALEIRO
Cidade
Universitaria
IFCH/UNICAMP
251 - Barao
Geraldo13083-859-Campinas.
E-mail:
fur
85577
13. France.
a semimeasure
algorithm property.
by the no randomized
Classifying
principles
- Paris 7. Case 7014. 75205 Paris
LIAFA.
Universite
Paris Diderot
CAROLINA
39.
canonical
I will introduce
functional).
they relate
measures
is no
be additive).
a natural
semicomputable
by a Turing
candidate
BIENVENU.
to a semimeasure.
to a lower
respect
considering
of each
* LAURENT
version
Fakultat
com.
respect
on the problem
that is induced
semimeasure
pairs
PAUL
13. France.
Research.
Operations
Universite
principles
of
and Logic.
AND
Werner-Heisenberg-Weg
LIAFA.
zoo
School
Algebra
PORTER.
Paris
E-mail.
property
for
Germany.
Neubiberg.
E-mail',
such
Siberian
decidability.
for constructive
HOLZL.
- Paris
Diderot
laurent.bienvenuUcomputability.fr.
Universitat
by
in Russia"
andsemimeasures.
E-mail:
Informatik.
for innovations
(under
and
1997.
York.
numberings
randomness
Algorithmic
Council
NSh-276.2012.1),
(grant
specialists
ulgebras
New
vol. 40 (2001), no. 5. pp. 315-326.

LAURENT
.
Ai
by the Grants
Schools
academic
Bureau.
Universal
of ; /^
8227).
Countable
Consultants
of
11-01-00236).
Scientific
and
No.
(Agreement
[2] N. T. Kocjaisaev.
enumeration
(grant
of Leading
"Scientific
[1] S. S. Goncharov.
and
by RFBR
supported
for State
President)
enumeration
Friedberg
Friedberg
223
13
COLLOQUIUM
AND
JOAO
Vaz"-
"Zeferino
SP.
On B-entailment.
MARCOS.
Rua
Sergio
Buarque
Brazil.
carolblasio9gmail.com.
of Mathematics.
Department
ccalmath.
E-mail:
ist.utl.pt.
IST/UTL.
Lisboa.
Portugal.

de Holanda.
224
LOGIC
DIM
Ap/UFRN,
E-mail:
The
received
of standard
such
organize
a general
in terms
Brazil.
by Tarski
approaches
structure
on
the structure
is expressive
[1] Arnon
and
Logic
Avron
[2] Matthias
for labeled
[3] Szymon
1dlh>
vol.
Baaz.
calculi.
Lecture
editors),
and
Computation,
Lev.
Lahav.
2012
Frankowski.
Anna
Formalization
Malinowski.
[5] D.
J. Shoesmith
Press,
versity
[6] Yaroslav
generalized
WILL
logical
AND
BONEY
and
values.
URL
URL
Address:
We outline
Classes
under
Sciences,
//www. math.
replaces
and
the basic
describing
local
of Economics.
E-mail:
boricicSekof
We define
von Wright's
possible
a much
and
Journal
of
semantics
finite-valued
D.
Miller
Springer.
Berlin.
inference.
Bulletin
and
U.
Sattler.
pp. 52-66.
2012,
of the Section
on Mathematical
Reports
logic.
of
Logic.
Uni
Cambridge
An inquiry
Falsehood:
in abstract
Forking
Mellon
Carnegie
emu. edu/~
into
classes.
elementary
5000
University,
Forbes
Avenue,
wboney/.
more
over
tameness,
(stability,
for Abstract
models,
and
type-shortness,
notion
complicated
of this relation,
properties
BORlClC,
Faculty
following
(partial)
of Shelah
we will explore
called
This
/-frame.
good
such
extensions,
Elementary
existence).
After
as the U rank
character.
BRANISLAV
Pi and
assumptions
extends
Effective
Truth and
//www. math. emu. edu/"

rami/.
http:
work to develop
a forking-like
relation
mild
that shows
2011.
GROSSBERG.
http:
ramiQcmu.
edu.
E-mail:
by
research
emu. edu.
wboneyandrew.
Address:
results
result
structures.
Multiple-conclusion
Wansino.
Berlin.
Pittsburgh,PA, 15232, USA.

E-mail.
form
multiple-valued
operation.
J. Smiley.
Springer.
RAMI
earlier
to recent
any 4-valued
of a plausible
Heinrich
of Mathematical
Department
a normal
and
relations
1978.
MA,
Shramko
We study
so as to define
vol. 7364.
Q-consequence
Timothy
and
Cambridge,
to extract
that general
([5]).
that it extends
Gramlich
(B,
Intelligence,
Logic, vol. 33 (2004), pp. 41-52.

[4] Grzeuorz
how
consequence
this connects
Zamansky.
(Manchester)
vol. 24 (1990), no. 1, pp. 49-59.
we show
& Smiley
from
a fresh
of cognitive
B-entailment.
how
we prove
For
of information,
piece
show
enough
of fact,
collection
abstract
rela
in terms
no. 3, pp. 241-261.
and
in Artificial
Notes
called
Non-deterministic
15 (2005),
Ori
1JCAR
a matter
from which
show
Finally,
([6]).
formalism
As
by Shoesmith
and
3]),
are often explicated
of a given
the underlying
of truth-values,
([4.
of truth-values
the B-entailment
and
about
result
S. Frankowski
and
structure
henceforth
means
abstract
with truth-values.
by an agent,
of entailment,
right as
by a richer
judgments
into an opposition
notion
of a bilattice-based
Malinowski
refutation/denial.
often confused
substituting
nondeterministicmatrix ([1, 2]).
- RN.
by semantical
own
of sentences,
are
or rejection,
characterization
G.
and
- Natal
introduced
in their
and
acceptance
attitudes
the well-known
prove
judgments
we propose
four-place
either
studied
or collections
as assertion
such
viewpoint
concerning
a generous
how
- 59078-970
Nova
Lagoa
or even
sentences
such
judgments
on the matter,
izes
consequence,
formalism,
proof
between
the semantical
attitudes
of logical
notions
of some
tions/operations
and
13
jmarcosQdimap.ufrn.br.
or by way
view
Universitario
Campus
COLLOQUIUM
social
preference
P
(see
logic
preference
to analyze
It is possible
of Belgrade.
.bg. ac.rs.
the multiple
von Wright's
> APB.
the crucial
some
new
to prove
results
mutual
the analogs
[6]),
In this context,
This,
6. 11000
simple
to express
of the Arrow-Sen
relationships
between
to well-known
theory
social
Arrow's
and
theory.
Serbia.
version
of the basic
individual
simultaneously
for instance,
and almost
choice
Beograd,
a generalized
logic,
allowing
and social
logic
preference
Kamenicka
preference
[5] and
relations.
AP,B
form/\1<(<n
as to consider
von Wright's
Multiple
University
the Pareto
propositional
(see
choice
Sen's
rule
[1], [3] and

theory
[4]).
axioms
impossibility

gets the
system,
makes
as well
(see
[2]).
theorems,
LOGIC
and
of the independence
the nature
perceive
this approach
simplicity,
[1] K.
Arrow.
[2] B.
BokiCic.
could
Social
of irrelevant
be of a particular
choice
and
alternatives
didactic
individual
225
13
COLLOQUIUM
interest
axiom.
Because
of its
too.
values.
John
Wiley.
the
Pareto
rule:
New
York.
second
1951,
edition, 1963.
Economic
liberalism
Dictatorship,
Annals,
vol.
[3] A. K. Sen.
of a Paretian
The impossibility
(1970), no. 1. pp. 152-157.

. Collective
[4 ]
edition,
Elsevier,
H.
[51G.
and social
choice
Wright.
The logic
1963.
. The
[6]
logic
M AR1JA
On entropy
BORltlC.
of Organizational
Faculty
Liberal.
Journal
welfare.
Holden-Day,
of preference.
Edinburgh
reconsidered.
of preference
pp. 140-169.
and
possible
impossible.
of Political
San
vol. 78
Economy,
Francisco.
1970,
fourth
1995.
Amsterdam,
von
and
pp. 45-54.
181 (2009),
of a propositional
Sciences.
Press.
University
and
Theory
decision,
Edinburgh.
vol.
3 (1972),
11000
Beograd.
logic.
of Belgrade.
University
Jove Ilica
154.
Serbia.
E-mail:
marija.boricicSfon.bg.ac.rs.
Each
be
of Shannon's
of a space,
measurable
algebra.
with
equipped
a measure,
two
By combining
partition.
partition
of the set of all propositional
theoretic
entropy
ing
with
L,
and
the growth
if m <
m of truth
values.
(true)
H(L,)
Kleene's
and
w-valued
The
BoriCic.
Computing,
ANAHIT
On entropy
CHUBARYAN
AND
Informatics
tion rules are introduced
logic.
DNF
every
(e-rule)
systems
logic,
are
logics
Lukasiewicz's,
Godel's
and
McKay's
logics.
Some
and Soft
Logic
propositional
proof
State
Yerevan
Mathematics,
{Aj,
K2
A-, (1
dDNF
infers K'
<
rule and
with full substitution
for Classical.
and
Intuitionistic
of introduced
{ />"\ />"22
rtj {\ < j < m) to each
of the remaining
variables
conjunct
from some
the
logics
propositional
of Multiple-Valued
CHUBARYAN.
Applied
K =
conjunct
ARM1NE
and
the efficiencies
and
MPL),
the values
logic.
logics
both
sys
University.
am.
achubaryanQysu.
am.
chubarmSysu.
families of elimination
The
Journal
on
infinite-valued
two-valued
four-valued
n-valued
k of its designated
finite-valued
infinite-valued
system.
and
is sensitive
Armenia.
Manoogian.
if assigning
of a logical
w-valued
for some
logic.
increas
logics.
of
Department
The
Dummett's
as a
logic
of a measure
monotonically
the number
classical
parti
to each
entropy
to appear.
tems for various
E-mail.
include
Belnap's
logics.
and
to classify
approximations
examples
Heyting's
on
an
of a many-valued
measure
and
generalization
the concept
logic
two
Our
by the
measurable
any
of many-valued
and
the entropy
for any
logic,
possible
side,
of a finite-valued
H(L).
/-valued
three-valued
and
<
from
the concept
on one
set induced
a natural
to assign
possible
to define
side,
starting
concepts,
able
Asymptotic
considered
makes
number:
makes
definition
Priest's
logics,
[1] M.
1PL,
of an
values
This
as well.
proposed
E-mail',
values
n, then
their entropies.
regarding
we are
of formulae
the other
theory,
formulae
of uncertainty
of truth
L.
number
1 Alex
the other,
on
a finite measure
We define
a partition
On
in measure
appearing
entropy,
with
identified
Lindenbaum-Tarski
corresponding
tion
can
system
logical
pii we obtain
of tp.
tp
as an axiom
U {p}
and
DNF
For
propositional
(CPL.
logics
for every
{tp
substitu
mentioned
0-determinative)
of tp (1 or 0) independently
for ip if tp =
(dDNF)
every
of the system
K'
with restricted
compared
1 -determinative
the value
is called
determinative
K,}
i < r) is tp-\-determinative.
K'
are
systems
"} is called
of tp can be considered
U K" from conjuncts
Minimal
formula
EC.
U {/>}.

The
tp each
of
and
conjunct
elimination
rule
226
LOGIC
DNF
The
some
substitution
rule infers
step substituted
By SEC
The
K/}.
if using
of variable
C\ U Ci
e-rule
be proved
the empty
< infers the set of results

in the conjuncts
p everywhere
from
can
C\ U {A}
and
U {/I},
Cj
conjunct
of substitution
of
of the set (I, generalized
where
A is a literal
or on any
formula.
we denote
If the number
EC
the system
of connectives
is denoted
by SeEC.
analogous
systems
system
is tautology
rule for the set of conjuncts
A instead
formula
elimination
K/}
Ki,...,
{K\,Ki,
(0) from the axioms {,
'13
COLLOQUIUM
with substitution
of substituted
EI.
SEI,
rule and
formulas
SeEI
SEM
{EM,
elimination
generalized
is bounded
rule.
by . then the corresponding

are defined
StEM)
for 1PL
(MPL)
also.
We denote
by FC,
1.
Theorem.
2.
3.
SeEC
the Frege
EC
{SEI.
This
Acknowledgment.
JAN DOBROWOLSKI,
and
by RC,
{RI,
RM)
RI.
and
RM
the resolution
RC
{Se+\EI.
are p-equivalent.
has
Se+\EM)
exponential
over
speed-up
in tree form.
and FC
SEM)
work
and
EM)
{EI.
Se+\EC
St EM)
SEC
systems
accordingly.
0 the system
{Si EI,
The systems
Instytut
FM
MPL
and
The systems
For every I >
the system
and
FI,
I PL,
for CPL,
systems
is supported
{FI.
are p-equivalent.
FM)
11-1 b023
by grant
of SSC
of RA.
Locally finiteprofiniterings.
Matematyczny,
Wroclawski.
Uniwersytet
pi. Grunwaldzki
50-384
2/4.
Wroclaw.
Poland.
dobrowolfflmath.
E-mail,
The
aim
in which
Krupiriski,
(Jacobson-)
bounded
semisimple
and
MARINA
DORZHIEVA,
versal
State
from
Street,
numbering,
the following
There
exists
a minimal
a universal
enumeration
is no a Yl\-computable
Friedherg
is no a positive n J-computable
enumeration
Department
of Mathematics,
Alvaro
AND
a modality
http:
a recursive
[i]
with
theorem.
Russia.
S ofW 1-sets.
of a family
of all n ] -sets.
but not the nj-.se/.?
vol.
35 (1970),
JOOST
Instituto
Obregon,
can
be enumerated
without
no. 2.
J. JOOSTEN,
Tecnologico
01080
Mexico
http://personal.us.es/dfduque/.
of Logic,
and
History
Philosophy
Address:
Given
of
The omega-rule
interpretation
logic.
6. 08001
Barcelona,
Montalegre
E-mail,
jjoosten0ub.edu.
URL
sets,
Logic,
DUQUE
provability
Department
meta-r.e.
of Symbolic
FERNANDEZ
Address:
enumeration
The
Owings.
The Journal
of transfinite
URL
radical
S of FI j -sets.
enumeration
of all n | -sets.
There
Tizapan.
compact
of a family
There
Progreso
rings of
small
results:
(4)
DAVID
matrix
in Analytical
We prove that there are uni
Hierarchy.
but there are not Friedberg's
and positive numberings
enumerations
We obtain
C.
Krzysztof
We classify
that the Jacobson
in Owing's
Novosibirsk.
(3)
[1] James
with
rings.
ru.
minimal
1. (1)
of metarecursion
2 Pirogova
exists
repetition.
work
joint
finite profinite
we prove
Next,
There
(2)
a recent
of locally
of them.
Elimination
minimal
numbering,
T heorem
results
ring is nil of finite nilexponent.
University,
dm-30040inbox.
for all n ! -sets.
a full classification
yields
We investigate
some
the structure
finite profinite rings as products

of complete
This applies
in particular
to semisimple
locally
finite profinite
E-mail.
pi.
over finite fields.
any locally
Novosibirsk
wroc.
is to present
we investigate
cardinality
G-rings
uni.
of this talk
Autonomo
of
Mexico,
Rio
Hondo
1,
Science,
University
of
Barcelona.
Spain.
//www.phil.uu.nl/~j
joosten/.
ordinal
A, the transfinite
provability
the intention
de
Mexico.
City,
of representing
logic
a sequence
GLPa
has
of provability

for each
<
predicates
A
of
LOGIC
increasing
We
is to read
possibility
T is a second-order
formalize
some
One
strength.
c. where
depth
[c]ct> as 4> is provable
conditions
arithmetic.
for T. the logic
in T using
an uj-rule
of
ACAo.
extending
in second-order
this notion
fairly general
theory
227
13
COLLOQUIUM
Our
main
is sound
GLPA
and
results
are
that,
under
for the resulting
complete
interpretation.
PHILIP
EHRLICH.
Surreal
ordered
of Philosophy.
Department
Ohio
45701-2979. USA.
J. H. Conway's
ordered
to the proviso
In addition
of sets of NBG.
structure
the
numbers
Ellis
Hall
202.
OH
Athens.
aforementioned
every such
subtree
of the entire spectrum

either
system
In particular,
of No
In the present
[1],
field of real
numbers
[1] Philip
Conway's
to a proof
pp. 1231-1258.
HADI
Number
FARAHANI
AND
with
systems
HIROAKIRAONO.
it is defined.
as
the surreal
small"
recursion
modulo
subfield
No
to an
a system
initial
subfield
of (No,
and
exp).
Gonshor.
A generalization
vol.
Logic,
Substructurul
on
exponential
subfield
hierarchies:
of Symbolic
result
of the ordered
to Kruskal
of
copy
that is an initial
of such
instance
due
the
in turn provides
of the aforementioned
simplicity
The Journal
much
of a transfinite
exponential
on No
Small".
a way that an isomorphic
proof
ordered
and
of which
arithmetic
of the theory
exponentiation
numbers.
of surreal
Great
field is isomorphic
that our
to an initial
defined
No's
that, subject
be individually
a rich algebraico-tree
great and
distinguished
ordered
out
by means
of Noa
that every model
is isomorphic
Ehrlich.
theory
we point
talk
exp is the recursively
subfield
has
is that
of "numbers
in a theoretically
real-closed
every
fields extends
real-closed
where
emerges
is contained
that does.
of ordered
as an initial
Numbers
No
of No
of defining
fields in such
process
fields,
in terms
clauses
numbers
spectrum
the recursive
"All
field.
features
set of surreal
of the entire
provisos,
of Noor
the recursive
inclusive
of ordered
to contain
as an ordered
algebraico-tree-theoretic
an unfolding
an unfolding
from
is so remarkably
as members
it may be said
from the empty
emerge
numbers
here
structure
that emerges
striking
that provides
of surreal
construed
to its distinguished
theoretic
Among
field No
that numbers,
in terms
definable
66
view of Glivenko
of
no.
(2001),
theorems
3.
and
translations.
negative
of Computer
Department
E-mail'.
Shahid
Sciences,
Center
Research
for Integrated
923-1292.
Ishikawa.
E-mail:
Beheshti
Evin.
University.
Tehran.
Iran.
com.
hadimathematicsQgmail.
Nomi.
Science.
Advanced
Japan
Institute
of Science
and Technology.
Japan.
onofijaist.ac.jp.
In [3], the second

for substructural
author
them
out that in these
pointed
an essential
predicate
involutive
extensions,
QFLe
it is shown
logic.
predicate
for which
approach.
shift scheme
negation
predicate
over QFLe.
logic
It will be
(DNS)
plays
V.vi1^3(.v) > t'V.vy?(.Y)
that the Glivenko
Moreover,
the Glivenko
we will study negative
Then
theorems
techniques,
not only to classical
predicate
double
the same
role.
others,
Among
by using
relative
logics
to Glivenko
approach
talk,
substructural
the following
(DNS):
classical
In the present
logics.
for substructural
to an arbitrary
but also
a proof-theoretic
has developed
propositional
we will extend
results
Terrace.
University
ehrlichQohio.edu.
E-mail.
logic
fields.
exponential
University.
Our
substructural
of involutive
give a clearer
theorem
unified
called
such
predicate
extended
logics
understanding
relative
for which
over QFLe
translation
the extended
of negative
among
by using
negative
way.
the existence
translation
by substructural

logics
to
over
logic.
in a natural
Kuroda
relative
(DNS)
logics
will induce
and
translations
predicate
predicate
predicate
theorems
logics
Kuroda
for QFLe1
one
to classical
of substructural
of Glivenko
analysis
holds
is the weakest
holds
translations
substructural
a negative
translation,
logic is proved among
theorem
this logic
the same
translation
We introduce
of the weakest
works.
point
Thus
we
of view.
228
LOGIC
[1] J Avium).
variant
Report CMU-PH1L.
Berardi
and
Science.
P. Oliva.
and
and
Logic
Ulrich
2011.
of the double-negation
translation.
On
various
Czech
(Brno,
Computation
van
Bakel
in Theoretical
Proceedings
Work
Stefano
Computer
pp. 21-33.
[3] H. Ono.
Glivenko
theorems
revisited.
Annals
of Pure
pp. 246-250.
* GILDA
Technical
Third International
(Steffen
Republic)
vol. 47, Electronic
editors),
Berger,
translations.
negative
Mellon
Carnegie
vol. 179 (2006).
[2] G. Ferreira
shop on Classical
13
COLLOQUIUM
FERREIRA.
Atomic
de
Departamento
Av. do Campo
Grande,
an elementary
polymorphism:
Universidade
Matematica,
1749-024
376,
and Applied
Lisboa.
de
normalization.
of strong
proof
Lusofona
161 (2009).
vol.
Logic.
Humanidades
e Tecnologias.
Portugal.
E-mail:
gildaferficii.fc.ul.pt.
In the early seventies,
Jean-Yves
the polymorphic
a predicative
version
the type variables
of F.
via
an
first noticed
candidates
referee, the proof
Arithmetic.
This
is joint
[1] F. Ferreira.
Comments
[2] F. Ferreira
and
G.
connectives.
[4] F. Joachimski
lambda-calculus,
Ferreira.
and
R.
vol.
MICHELE
FRIEND.
Philosophy
D.C.
20052,
Department.
USA.
the range
of
in [3],
presented
argument:
The
no need
as pointed
proof for F. However,
by
in the sense that it is not formalizable
of strong
proof
Journal
of Philosophical
conversions
The Journal
Matthes.
conversions
and
normalization
Ralph
Matthes
George
vs. the standard
of Symbolic
proofs
and
Godels's
formal
Washington
Logic,
vol.
35
conversions
of
pp. 63-84.
Short
a paraconsistent
Using
was
Joachimski
92 (2009),
vol. 42 (2003), no. 1, pp. 59-87.
in
polymorphic
i.e..
by Felix
logic.
Commuting
Logica.
permutative
interested
atomic
of the normalization
used
independently,
are
Ferreira.
polymorphism.
pp. 260-274.
the
instantiations,
an elementary
on predicative
Studia
. Atomic
[3 ]
we present
with Fernando
(2006), pp. 1-8.

the "good"
[1.2]).
normalization
for normalization
we
the restriction.
F, embeds
Despite
A proof of strong normalization
of reducibility,
in [3] is not elementary,
In this talk
work
Ferreira:
types.
(see
talk
present
universal
technique
as in Girard's
the strategy
in [4],
calculus
introduced,
Reynolds
the
by Fernando
of Fa( led to a simplification
an anonymous
for Fat, adapting
In
to the atomic
of Tait's
for reducibility
in Peano
John
F.
of F to atomic
propositional
adaptation
requirement
predicativity
and
or system
in Fal is restricted
the full intuitionistic

for Fa(,
Girard
calculus
Fat is the restriction
F.
system
lambda
Logic,
of normalization
T. Archive for
theory of logic
University.
801
vol.
78 (2013).
no.
for
the simply-typed
Mathematical
1.
Logic.
metaphorically.
22nd
St.
N.W.,
Washington
E-mail:
Michelefigwu.edu.
I make two points.
First,
inconsistent
mathematical
advance
that one
theories
together.
threat
their
and
is better
So.
of triviality
direct.
Second,
One
characterisecharacterize
MAKOTO
and
or correct.
the
This
use
distinction
calls
made
for their
FUJIWARA
AND
unprovability
Mathematical
Institute,
related
Tohoku
ULRICH
to WKL
University,
is not
use
of paraconsistent
of the indirect
example
the dialectical
use and
intuitionistic
of mathematics
of mathematics
philosophies
In some of the discussions
the "use-mention"
is immediate.
reasoning.
not
in the philosophy
pluralists
theories
is usually
logic
of a logic
give an example.
Aramaki
upheld.
of a paraconsistent
is a dialectical
Classical
KOHLENBACH,
6-3.
they also
always
use
in higher-order
sb0m29fflmath.
tohoku.
ac.
together
in
deciding
use inconsistent
the
Therefore,
logic
to guide
metaphorical,
I shall
use.
non-uniformity
and
arithmetic.
Aoba,
Aoba-ku.
Japan.
E-mail.
compare
without
jp.

Sendai.
Miyagi.
LOGIC
of Mathematics,
Department
Darmstadt,
E-mail:
uniformization
that
a similar
for numbers
orem
formulas.
For
are arbitrary,
have
the form
with weak
HA)
of research,
In addition.
comprehension.
of WE-PA'"
WE-PA
(resp.
and
for universal
version
of
is the uniform
(32)
WE-HA
f (resp.
the
is the
is the full
QF-AC)
is the uniform
to primitive
WE-HA'")
shown
variables
WE-HA'")
of premise
UWKL
of
S is
the following
(resp.
BI is bar induction,
lemma.
with
(resp.
AC
extensionality.
in all finite types,
principle
we show
WE-PA'"
. then
it is recently
for systems
holds
Here
statement
ri2
in RCAq
provable
is the independence
IP'v
is the Konig's
for every
f) defined
recursion
by
of type 0
induction.
quantifier-free
I.
this line
of choice,
is the restriction
Theorem
p,z
KL
of arithmetical
S. Feferman
and
axiom
lemma.
WKL
of all finite types.
of PA (resp.
M1" is the Markov
Konig's
variant
7,
SchlossgartenstraGe
Moreover,
system.
additional
Along
that
of S is not
intuitionistic
functions.
quantifier-free)
states
version
with
of functional
finite type extension
weak
proposed
proposition
and
in a setting
(resp.
Darmstadt,
de.
in [2]
if the sequential
in the corresponding
provable
in [I]
only
tu-darmstadt.
theorem
form,
syntactical
not
Universitat
Germany.
kohlenbachSmathematik.
The
some
Technische
229
13
COLLOQUIUM
every statement
is purely
B{x)
3 c \/wDqf.
universal
> 3 yTC(x,y))
(B(x)
and
where
of (WE-PA'")
the premises
of all
(>)
types
in C(x,
occurring
y)
if
WE-PA'" + QF-AC + UWKL h 3 Yt(f)Vxp (B(x)
-> C(x, V(x)))
-> (32),
then
WE-HA'"
+ AC
+ M'"
+ Ify
+ UWKL
KL
BI V- V.*''
(fl(x)->3/CU>0).
This also
holds for W|Tpa"|
The
is based
proof
and \NEMfk\
on monotone
the use of a nonstandard

ical
f + AC
WE-PA
f) is replaced
[1] F. G.
+ IFy
[2] J. L.
excluded
Hirst
middle.
JAIME
Classical
Dame
and
GASPAR,
INRIA
C.
Notre
Mummert.
with
function-based
semi-intuitionistic
system
is false if WE-PA'"
E-PA
(resp.
choice
(the
RCAq
theorem
E-PA'"
of continuous
(resp.
f).
from
principles
intuitionistic
to appear.
Logic,
Reverse
Journal
above
system
consequences
Dame
system
in the strong
The
translation
negative
that there are a lot of mathemat
suggests
classical
-(- KL.
of Formal
Journal
and
interpretation
but are not provable
+ UWKL
and WE-HA'".
o/WE-PA'"
result
in the weak
provable
RCAo)
+ M'"
Our
by the fully extensional
Dorais.
Notre
analysis.
are
of set-based
WE-HA
F-.
principle
which
statements
counterpart
instead
functional
mathematics
of Formal
Logic,
and
in proofs
uniformity
52 (2011),
vol.
no. 2, pp.
without
149-162.
Cantor.
"Refuting"
Univ
nr1.
Paris-Rocquencourt,
Paris
Diderot.
Sorbonne
Paris
Cite.
F-78153
France.
Le Chesnay.
E-mail,
mailjaimegaspar.com.
Address:
www. j aimegaspar.
mathematician
The German
com.
URL
his
celebrated
and
numbers
authors
natural
seek
is accepted
and
numbers
The
we show
this amusing
author
de Paris.
The
used
is no
his famous
diagonal
between
bijection
argument
the
set of all
to prove
natural
was
some
to examine
two points
mathematical
by proposing
of the more
for each
that there are some
talk short,
financially
author's
theorem
community.
between
bijections
Despite
this,
the set of all
the set of all real numbers.

We make
theorem.
in the "refutation";
We keep
there
by the mainstream
to refute Cantor's
In this talk we are going

of Cantor's
Cantor
that
showing
the set of all real numbers.
theorem
Cantor's
some
theorem
Georg
simple,
and
interesting
"refutation":
interesting
ideas
proposed
we show
inspired
"refutations"
is the mistake
by the "refutation".
sweet.
Fondation
Sciences
Mathematiques
by the French
in the Logic Colloquium
2013 was partially
supported
supported
participation
what

230
LOGIC
by the Deutsche
Exakten
WILLIAM
Henkin's
fur Mathematische
Vereinigung
Wissenschaften
und
Logik
fur Grundlagenforschung
der
(DVMLG).
GUNTHER
AND
RICHARD
STATMAN.
Lambda-delta-definabilityand
theorem.
Mathematics
Department,
E-mail:
E-mail:
emu. edu/~
//math.
http:
5000
University,
Forbes
Avenue,
Pittsburgh,
emu. edu.
wguntherfflandrew.
Address:
Mellon
Carnegie
PA 15232. USA.
URL
'13
COLLOQUIUM
wgunther.
rs31fflandrew.cmu.edu.
The
/(5-calculus
We consider
discriminator,
result
symmetric,
i.e..
facts from algebra
theorem
fixed
of Henkin.
Then
to be /^'-definable
a stronger
Proof
8-10.
1040
In addition
shorter
and
This
to functions
sufficient
only
only
type via a
for a function
which
quantifier,
over
if it is
uses
proof
of lowest
condition
or existential
operator
and
Vienna.
on []
requires
to rendering
Vienna
Geometry,
of Technology.
University
Wiedner
Austria.
ac.
at.
the use of lemmas
models
theory
of n elements.
functions
if and
quantifier
a
we
First,
and grammars.
Mathematics
Stefan.hetzlffltuwien.
E-mail:
a necessary
the description
type.
in the full type structure
existential
by permutations
a way to reduce
we prove
Proofs
of Discrete
HauptstraBe
and
with
augmented
all of lowest
quantifier
terms.
distinguishing
variable
type
of symmetry.
HETZL.
Institute
and
a discriminator
atomic
that a function
says
operator
an action
without
notion
STEFAN
under
one
an existential
which
from the description
elementary
over
and
operator,
of a folklore
[] is /^-definable
with
augmented
/.-calculus
typed
description
a proof
provide
is the /.-calculus
the simply
a proof
more
in mathematical
readable
by the inference
proofs
the use of cuts may also
lead
in theoretical
science.
rule of cut.
to a significantly
proof.
Formal
language
for specifying
is an important
theory
formal
area
such as grammars
languages
computer
and automata
play a central
Mechanisms
role in a variety
of applications.
In this talk
I will speak
theory
by characterizing
formal
grammars.
This
connection
Herbrand's
guage
and
thus
with cut with
of the grammar
ASSYLBEK
for
Some
that connect
power
proofs
in
of classes
classical
a cut-free
identifying
a grammar
describing
proof theory to formal language

of cut-formulas
of
by classes
first-order
with
proof
this language.
on
logic by relying
a finite tree language
and
The
of the lan
computation
to cut-elimination.
computable
numberings
of the families
of total functions
in
hierarchy.
of Mechanics
Department
Al-Farabi
results
then corresponds
ISSAKHOV,
the arithmetical
recent
is established
theorem
the proof
about
the compression
Ave.,
Almaty
and
050038,
Mathematics,
Al-Farabi
Kazakh
National
University,
71
Kazakhstan.
E-mail:
asylissakhovfflmail.ru.
A numbering
v: at i-> T of a family of unary computable
functions
is called computable
if the binary
function
is computable,
A Friedberg
of a family is
v(n)(x)
[3].
numbering
one-to-one
It is well known
that the Rogers
semilattice
of
just a computable
numbering.
a computable
nontrivial
case,
infinitely
many
We
generalize
arithmetical
n io.
of one element
or is infinite, [3]; and that, in the
family T either consists
it is never a lattice and has no maximal
elements:
and contains
either one or
minimal
hierarchy
A numbering
computable
elements.
[4],
the notion
relative
of computable
numbering
following
[1], Let J7 be a family
v: a> >-> T
is called
to the oracle
0<n) [1],
I+,
-computable
for the families

of total
unary
of functions
functions
if the binary

function
in the
from I+],
v(n){x)
is
LOGIC
Theorem
C 1JJ+2 be an infinite J.0+2-computable

family
number ings.
Friedberg
nonequivalent
Let T
i.
231
13
COLLOQUIUM
Then
of total functions.
T has infinitely many pairwise

Theorem
2.
This
3.
T aiul J.+2-computahle
to a.
is reducible
of T
numbering
contain
If T
a of the family
numbering
such
2. [2]:
to Question
is a solution
Theorem
are a family
There
that no Friedberg
two functions,
at least
then J~ has
no principal
semilattices
of families
lP+2-computable
numbering.
[1] S. A. Badaev
Algebra and Logic,
S. S. Goncharov.
Cholak.
Boulder,
L. Ershov.
[3] Yu.
The computable
AKITOSHI
vol.
plexity of Laplace's
The University
of Tokyo.
113-8656
Tokyo
Darmstadt.
E-mail:
of Information
ac.
theorems
mathematical
sufficient
systems
integration.
7-3-1
Science.
Hongo.
in classifying
interest
their
Bunkyo-ku.
(see
proof
of computability.
worst-case
in) classi
the
underlying
the works
e.g..
of S. Simpson,
Brattka).
power(V.
We pursue
the latter
(M.
Braverman
complexity
claims
of
terms
as well as in terms of their computational
computational
Germany.
(existence
in
strength:
for their
necessary
WEiHRAUCH-)degrees
of asymptotic
7. 64289
Schlossgartenstr.
to
according
and
H. Ishihara)
U. Kohlenhach.
that is. (e.g.,
Com
de.
tu-darmstadt.
last years
logical
func
jp.
of Mathematics.
zieglerSmathematik.tu-darmstadt.de.
have seen an increasing
The
to ordinary
compared
School
s .u-tokyo.
Department
f . steinbergQstud.
E-mail:
recursive
of general
AND MARTIN ZIEGLER.
STEINBERG.
Equation
Graduate
1977
Moscow.
of families
of
Japan.
kawamuraQis.
E-mail:
view
sets.
no. 5. pp. 326-336.
FLORIAN
Poisson's
and
enumerations
11 (1972),
KAWAMURA.
Nauka.
(in Russian).
of numberings
Theory
[4] S. S. Marchenkov.
tions. Algebra and Logic,
cal
of arithmetic
Mathematics(Peter
Contemporary
Open problems.
A. Shore, editors).
Lerman
and Richard
Manuel
University
Lempp.
2000. pp. 23-38.
Mathematical
vol. 257. American
Society.
Steffen
Colorado.
TU
Rogers
no. 5. pp. 283-291.
. The theory of numberings:
[2 ]
A.
and
vol. 40 (2001).
under
&
the refined
S. A.
Cook
2006).
H.
Friedman
Ko
related
have
(1982)
to one
of the
basic
shown
Millennium
in numerics
operations
Problems:
to be sur
maximum
The
operator
(x i-> max{/ (/): 0 < t < ,v}) e C[0:1] maps polynomial-time (V) com
C[0:1]
^ f
putable
functions
for smooth
even
Ker-I
and
and
hard
prisingly
to ones
essentially
/ e
arguments
i->
B f
operator
C[0:1]
solution
u to the ordinary
of the indefinite
to the question
=
u'{t)
f[t.u{t))
of V versus
is related
dt)
differential
that is in general
the complexity
Similarly,
J* f(t)
(.v
to MVand
belonging
C[0:1],
equation
with
optimal,
integral
#V.
The
polynomial-time
computable C1 right-handside /: [0:1] x [1:1] > [1:1] and initial condition u{0) = 0
can
even
be as complex
The
as PSPACE
work starts exploring
present
classical
with computable
equations
Pour-El&Richaros
1981).
Au =
(1)
(.Note
'Steinberg's
(ASL)
Exakten
domains
that our uniform
and
travel
Wissenschciften
solutions
for simple
questions
(as
opposed
elliptic
to the hyperbolic
partial differential
Wave equation:
u 0 on dQ
fi C
[1:1]''
complexity
to LC2013
by Deutsche
analogous
u = g on dd
0 on fi.
(2) Au = / on Si.
for fixed open
201 Off).
(Kawamura
was
Vereinigung
and
theory
partly
fur
/: Q
continuous/smooth
requires
supported
Mathem.
/ to extend
> R and
by the Association
Logik
g:
dl
-4 R.
to dO..)
und fur
for Symbolic
Grundlagenforschung
(DVMLG).

Logic
der
232
LOGIC
BEIBUT
KULPESHOV.
Department
mation
remarks
Some
of Information
34
University
Technology
on weakly
and
Systems
13
COLLOQUIUM
Manas
minimal
circularly
Mathematical
A
str./8
groups.
International
Modelling,
Zhandosov
Infor
050040.
str.,
Almaty,
Kazakhstan.
E-mail:
b.kulpeshovSiitu.kz.
We
D.
continue
(col)
(co2)
(co3)
(co4)
A set A of a circularly
following
we have
c A.
o-minimal
Some
weak
ordered
foranyc
(with
ordered
c,b)
subset
is weakly
of the interesting
divisible.
[1] B. Sh.
ical
Logic
Kulpeshov.
[3] B. Sh.
Kulpeshov
D.
Logic
Macpherson
but
been
and
of weakly
weakly
KURAHASHI,
Graduate
School
50 (2009),
E-mail:
Priest
[4] showed
Ch.
weakly
weakly
in general.
that are not weakly
minimal
groups.
structures.
Mathemat
minimal
circularly
conditions
Minimality
vol.
51 (2005),
Steinhorn.
On
Kobe
Informatics,
that arithmetical
theorem.
of the second
proofs
structures.
ordered
Annals
of Pure
of o-minimality.
of Yablo's
University,
on circularly
pp. 377-399.
variants
paradox
using
of a standard
provability
paradox.
1-1 Rokkodai,
theorem
Nada,
Kobe,
and
of each
Cieslinski
on Priest's
and
Japan.
that for each
result
of YR(x)
by using
to Godel's
Urbaniak
formalization
of the formalizations
prove
instance
our
[5] leads
paradox
[2], and
based
phenomenon
We prove
predicate.
of Yablo's
Kurahashi
predicates,
the undecidability
proof
and
the incomplete
Rosser's
Ii-sound.
formalization
Kikuchi
incompleteness
We investigate
paradox.
is not
true
tykkel60gmail.com.
first incompleteness
gave
Any
pp. 282-301.
Rosser-typeformalizations
of System
sets.
that they are abelian
proved
minimal
minimal
circularly
is not
structures
was
and Applied Logic, vol. 79 (1996), pp. 165-209.

TAISHI
is weakly
of convex
circularly
A the
G M mthK{b,c,a)
inverse
circularly
in the No-categorical
Quarterly,
and
the
minimal
studied,
H. D. Macpherson.
and
Mathematical
[4] H.
pp. 555-574.
vol.
Journal,
=
(M, K,...)
is a finite union
properties
functions
Mathematical
structures.
have
some
52 (2006),
. Definable
[2 ]
Siberian
by
relation
if for any a.h
e ôrforanyc
circularly
On ito-categorical
vol.
Quarterly,
by a ternary
to be convex
minimal,
of weakly
groups
we discuss
is said
of M
circularly
examples
minimal
Here
studied
originally
is described
wehavec
structure
parameters)
structure
In [4] circularly
minimality
relation
structure
6 M with K{a,
o-minimal were studied in [3, 1. 2],

and
circular
order
> K{y, z, x))\

A K{y, x, z)
x = y V y = z V z = x);
>\/t[K(x, y, t) V K(t, y, z)]);
V K(y, x, z)).
A circularly
if any definable
of
A circular
conditions:
VxV>'Vz(Ar(x, y, z)
VxVy\/z(K{x, y, z)
Vxiy\/z{K(x,y, z)
Vx\/yVz(K(x, y, z)
holds:
notion
me in [3].
the following
satisfying
the
studying
and
Macpherson
of Yablo's
YR{x)
consistent
theory
is dependent
the technique
[1]
of Yablo's
on
which
the choice
of Guaspari
and
Solovay [3],
[1] Cezary
Philosophical
[2] Makoto
Cieslinski
Rafal
Urisaniak.
to appear.
and Taishi
Kikuchi
Kurahashi.
theorems
pleteness
and
Godelizing
the
Yablo
Journal
sequence.
of
Logic,
Journal
(in Japanese).
Three
of the Japan
short stories
Association
around
Giidel's
for Philosophy
incom
of Science.
vol. 38 (2011), no. 2, pp. 27-32.

[3] David
Logic,
vol.
Guaspari
16 (1979),
[4] Graham
Priest.
[5] Stephen
Yaiilo.
and
Robert
M.
RUTGER
KUYPER,
Department
GL
Nijmegen.
E-mail,
of
Rosser
Analysis,
vol.
1, pp. 81-99.
Yablo's paradox.
Paradox
without
pp. 251-252.
Solovay.
sentences.
Annals
of Mathematical
no.
Factors
Mathematics,
of the Muchnik
Radboud
57 (1997),
self-reference.
lattice
University
Analysis,
characterising
Nijmegen,
no. 4, pp. 236-242.

vol.
53
(1993),
intuitionistic
P.O.
the Netherlands.
r.kuyperamath.ru.nl.

Box
no.
4,
logic.
9010.
6500
LOGIC
In an attempt
two
to characterize
[1] and
way, Mededev
lattices
are
in fact
semantics
algebraic
lattices
for IPC.
propositional
[2] introduced
Brouwer
a proper
capture
intuitionistic
Muchnik
it turns
Unfortunately,
of IPC:
and
Muchnik
structure
out
they realize
in a computational
(IPC)
logic
the Medvedev
the algebraic
algebras,
extension
233
*13
COLLOQUIUM
lattices.
suitable
that the Medvedev
the weak
These
for describing
and
Muchnik
law of the excluded
middle
-i p V
not all is lost.
Fortunately,
lattice
which
does
lattice
by Sorbi
exactly
and
In [3] Skvortsova
capture
Terwijn
manner
computational
interpretation.
if there are in fact any natural
the question
factors
raises
which
natural
Our
IPC.
capture
factors
In this talk we give an affirmative
arise
from well-known
T. Medvedev.
[1] Yu.
computable
[2] A.
A.
On strong
Muchnik.
[3] E. Z. Skvortsova.
A faithful
of an initial segment
means
(1988). no. 1. pp. 171-178.

[4] A. Sorbi
and
have
such
E. LEIGH,
Faculty
of Philosophy.
reducibilities
of algorithmic
of the intuitionistic
interpretation
lattice.
Intuitionistic
Sihirskii
and
logic
E-mail:
graham.
The
predicate
Muchnik
expressing
satisfy
Tarski's
definition
that
of induction
is not extended
[1 ]. I present
standard
terms
whence
idea
method,
ordinal
Zhurnul.
degrees.
denote
truth,
enjoys
[1] H.
ILLC.
E-mail:
can
of the
corollary
LI.
Cunudian
Degrees
University
z.Ii0uva.nl.
at steps
infinite games
an
Via
A.H.
107,
games
player
Provided
the schema
extension
of the conservativity
of
result via
is straightforward.
for CT-
depth.
XG
to terms
only
ones
that
context
base
without
proof
the
on
theorem
provably
for
procedure
and
conservativity
is the
that
result
theory.
of satisfaction
24 (1981),
no.
of choice.
the Netherlands.
information.
the other
classes
1, pp. 283-93.
the axiom
Amsterdam,
with perfect
and
truth-free
cut-elimination
truth-free
vol.
the
By expanding
that every
Construction
wins
unary
a set of codes
is a conservative
in this
1098
by a fresh
forms
free variables,
of infinite games
of 2-player
of T
over its truth-free
Bulletin,
Park
arithmetic
on
applies
Lachlan.
Mathematical
one
UK.
feature
a finitary
of cut-elimination
to finish and
6GG.
necessarily
I prove
by purely
speed-up
Science
truth.
of ee
logical
predicate
and
Univer
bound
upper
derivations
standard
be replaced
we will study a kind
takes
cut-elimination
the truth
of non-determinacy
of Amsterdam.
derivation
in [1],
use
by
vol. 29
Algebra
OX2
for arithmetic.
formulae
complexity.
S. Krajewski
models.
In this paper
games
derivations
Kotlarski.
of this kind
logical
at best hyper-exponential
for nonstandard
* ZHENHAO
of no
in which
with fixed
latter
is obtained.
CT~
formulae
Peano
the theory
at best
the co-rule,
nonstandard
a derivation
has
formulae
these
Without
denote
of approximating
of CT-
of truth
provides
Oxford
the extension
language,
of the co-rule.
however,
of CT".
can
extends
that
a new purely proof-theoretic
In the presence
cut-elimination.
theoretic
to the new
Road.
calculus
propositional
Mutemuticheskii
uk.
CT".
axioms
of sentences
The
truth.
and
Nuuk
Sihirskii
problems.
for compositional
Woodstock
ox. ac.
leighfflphilosophy.
symbol
arithmetic
of Oxford.
of compositional
theory
and cut-elimination
Conservativity
University
lattice.
as lowness.
Akademii
Doklady
salis. vol. 67 (2012). pp. 175-188.

GRAHAM
or Muchnik
for the Muchnik

concepts
clear
any
1328-1341.
pp.
of the Medvedev
S. A. Terwijn.
and
weak
vol. 4 (1963),
Zhurnal.
not
of the Medvedev
answer
problems.
SSSR (NS), vol. 104 (1955). no. 4. pp. 501-504.

Mutemuticheskii
are far from natural,

do
traceability.
of difficulty of the mass
Degrees
and
computability-theoretic
and
hyperimmune-freeness.
1-genericity.
ad
of the Medvedev
for the Muchnik
adapted
they construct
hoc
This
in an
later
that
they
constructed
was
in the sense
lattice
are
that there is a factor
this result
the factors
However,
[4],
shows
and
IPC.
loses.
Each
We call
game
these
for simplicity.
of infinite games and showed

that they
Blass [1] introduced
the degrees of non-determinacy
he
for
form a complete
lattice.
the
axiom
of
choice
showed
that
each
cardinal
(AC)
Using
of infinite
of degrees
of nondeterminacy
k such that 2" =
there are certain
properties

234
LOGIC
on k (or degrees
games
of nondeterminacy
of Blass's
Many
linear
theory
systems
theory
(ZF)
It follows
that does
logic.
AD
In this paper
clear.
We will show
that
degrees,
of order-type
w\ or antichains
and
Blass.
. A game
[2 ]
Kanamori.
KRISTINA
LIEFKE.
Center
Munich
Kristina.
A single-type
Montague
of English
through
Our
defines
of infinite
games
then
we get classical
like are not imme

called
the degrees
real-cocling
on k has
[3] for the definition
Fundament
Annals
logic.
of Pure
Springer
of 0)
at least
have
chains
a Mathematicae.
and
Applied
vol.
Logic,
in
Monographs
vol. 78
52
Mathematics,
and
desired
uses
one
behavior
Church's
(via
of a designated
are
not
a set of nonlogical
of these
constants
[4].
types
in this logic,
type
To
of
many
for this
compensate
that serve
is enforced
whose
(cf. [2])
rule for the formation
in TYi.
constants
logic)
single-type
[1]
Boolean
available
TYi
(hence,
TY2
fragment
In this paper,
propositions.
type
logic
a small
interprets
and
basic
type for propositions
quantifiers
which
theory
individuals
of Gallin's
of the absence
we introduce
de.
types:
only
Miinchen,
Ludwig-Maximilians-Universitat
Germany.
type
is a subsystem
Because
The
intensional
which
theory
TY|,
connectives
shortcoming,
for the PTQ-fragment.
uni-muenchen.
an
from the TY2
types).
stand-ins.
a> and
look
of games.
Munich.
the use of two basic
logic,
are constructed
standard
on
cardinals
AD
(see
infinite.
logic
1. D-80539
a same-scope
single-type
function
set
w\ .
Philosophy,
Liefkefilrz.
In [3],
we define
higher
for Mathematical
Geschwister-Scholl-Platz
E-mail:
in
in set
2003.
Springer-Verlag,
on 0
for linear
The
to logic
with Zermelo-Fraenkel
degrees
kind
under
of indeterminacy
semantics
We are interested
their connections
we work
two
only
on a special
w is regular
(1992), no. 1-3. pp. 183-220.

[3] Akihiro
are
of cardinality
Degrees
and
on uncountable
that the degrees
(1972). no. 2. pp. 151-166.
structure
(AD).
there
we focus
the degree
rely on the use of AC.
In this paper
the degrees
that if k >
four different
[1] Andreas
AC.
between
in [2].
[2] heavily
of determinacy
But what
is a connection
of nondeterminacy
not contain
from
directly
propositional
games.
of degrees
with the axiom
There
established
logic
in [1] and
results
the structures
exploring
diately
on k in short).
and
13
COLLOQUIUM
as their single-type
the use of meta-level
through
axioms.
We
show
that the resulting

in virtue
particular,
TY1
type.
and
interprets
names
proper
language
conditions
[1 ] Daniel
Gallin.
North
[2] Leon
Intensional
Henkin.
[3] Richard
of Richard
(which
TYi
on
induced
are
translations)
Montague's
The
English
London,
Montague.
1976.
Krifka
MADEIRA.
of propositional
English
(Richmond
pp.
modal
Netherlands.
HASLab
Dep.
E-mail,
basic
truth
by the
findings
in
as a formal
H. Thomason.
logic
with applications
- INESC
types.
Fundamenta
language.
Format
Yale
editor),
Mathematicae.
philosophy:
University
vol.
Selected
Press.
New
52
papers
Haven
188-221.
Partee.
Do
(Sigrid
Beck
M.
A.
MARTINS.
AND
we need
TEC
& Dep.
Mathematics,
and
two basic
Hans-Martin
types?
Snippets:
Special
editors),
Berlin.
Gartner,
L. S. BARBOSA.
Hybridised
Univ.
Aveiro,
Portugal.
madeirafiua.pt.
Univ.
Mathematics,
to Montague
1975.
tions.
E-mail,
resulting
expressions
by recent
supported
In
fragment.
by a single
propositions
for sentences.
type
are
and higher-order
Amsterdam,
A theory
Montague
[4] Barbara
A.
for their
Holland,
(1963). pp. 323-344.
Manfred
in the semantic
from
and
development.
semantics.
and
all expressions
of individuals
for names
equivalence-conditions
corresponding
models
logic
of the replacement
Aveiro,
Portugal.
martinsfiua.pt.

issue
in honor
2009.
pp. 37-41.
logics
for specifica
of
LOGIC
- INESC
HASLab
E-mail:
Hybrid
which
logics,
states,
able
applications
In this work
originally
Informatics.
to evolve
Univ.
Minho.
Portugal.
in [2]. which
each
sponding
The
a two-stage
by a transition
states,
of complex
to
software
configurations.
methodological
of such
aspects
a framework,
method:
structure
described
in a modal
as possible
regarded
with a specification
at each
locally
candidates,
first-order
embodies
dynamics
state
execution
and
the ability
structures
to the specification
of the system's
language
configurations:
local
at the corre
behavior
configuration.
used
logic
different
to refer to individual
local
of transition
description
framework
the foundations
the system's
represent
Typical
to the modal
through
we discuss
proposed
endow
add
offer an expressive
with the ability
& Dep.
lsbQdi.uminho.pt.
refer to specific
TEC
235
'13
COLLOQUIUM
but one
logic,
configuration
used
widely
Science,
are
to multivalued
resort
may equally
on
depends
in Computer
the application
requirements.
or
equational.
partial
algebra,
or probabilistic
logics or even
to
Instead
itself equipping,
in the last case, each state with another
transition
(local)
system.
a particular
a systematic
of choosing
version of hybrid logic, we propose
method
to
develop
on top of each
modal
logic
of syntax
is called
process
is framed
treated
local
modalities,
(i.e..
and
hybridization
and
etc.)
features
of hybrid
of the semantics
both
logic,
(i.e..
of institutions,
each
and
(base
logic
at the level
This
worlds).
possible
in [3. 1], To be completely
was characterized
of the theory
in the context
this
general,
hybridised)
being
as an institution.
abstractly
[1] R
the characteristic
logic,
nominals.
Diaconescu
and
A. Madeira.
Encoding
institutions
hybridized
into first order logic.
submitted.
[2] A. Madeira.
reactive
International
[3] M.
A.
institutions.
Lecture
Martins.
(Gilles
Barthe.
vol.
A.
R.
Madeira.
in Computer
MANUEL
de Filosofia.
E-mail:
logical
and
Pardo.
AND
FES.
and Gerardo
2011.
Corina
of
9th
Methods,
Schneider,
pp. 269-285.
Hybridization
Cirstea.
of
2011.
editors).
pp. 283-297.
M.
to equality
Edificio
specification
Formal
L. S. Bariiosa.
and
Springer,
symbols
Hybrid
and
Springer.
Klin,
martinsQua.pt.
of Computer
Barcelona.
Universitario
Campus
Science.
Department
ANTONIA
HUERTAS.
and abstraction.
37007
Salamanca.
Spain.
Open
de Santiago.
University
University
of Catalonia.
of Aveiro.
Poblenou
Rambla
3810
156.
Spain.
mhuertassQuoc.edu.
E-mail:
relation
and
definition
itself and
this notion
role
concepts
of identity
and
any object
central
vol. 6859.
Unamuno.
Campus
of Mathematics.
Department
- 193 Aveiro.
Portugal.
The
Bartek
A. MARTINS.
reducing
Alberto
7041.
Diaconescu.
Corradini.
Science,
L. S. Barhosa.
Engineering
maraSusal.es.
E-mail'.
08018
2011
and
Software
Science,
hybrid logic:
Facultad
approach.
in Computer
(Andrea
MANZANO.
Equational
M. A. Martins,
SEFM
Notes
CALCO
Notes
MARIA
Faria.
Conference,
Lecture
editors).
J. M.
An institutional
systems:
which
plays
kind
of the other
is usually
understood
as the binary relation which holds between
which fails to hold between
Due to the
any two distinct objects.
in logic, it is interesting
how to define it using other logical
is required,
or else in the opposite
scheme:
namely, in the
in
terms
of
the
relation.
concepts
identity
of logic
logical
to the question
of equality
it is
being defined in terms of other logical
Respect
symbols,
known that in first order logic identity cannot
be defined with the other logical concepts.
In
can be defined by the Leibniz's
and the relation defined
second
order logic equality
principle,
by this
formula
structures,
is 'genuine'
identity.
there is no guarantee
in second
However
that the equivalence
relation
order
logic
defined
with
nonstandard
by Leibniz's
principle
is identity.
Here
is an old
the reverse
one
which
question
was
is posed.
tackled
The
with some
idea
of reducing
in 1923
success
the other
by Tarski.

concepts
who
to identity
solved
the case
236
LOGIC
for connectors;
three years
It was
quantifiers.
later Ramsey
raised
in 1963
answered
finally
'13
COLLOQUIUM
the whole
by Henkin
in 1937
subject;
with his system
introduced
Quine
of propositional
type
theory.
work
This
is developed
with equations
satisfaction
and
logical
abstraction
can
symbols
DANIELE
E-mail:
53100
we will show
logic
and
the
hybrid satisfaction
that all of the remaining
ANDREA
The first order
SORBI,
theory of the s-degrees,
dell'Informazione
e Scienze
Matematiche.
Universita
di Siena,
dell'Informazione
e Scienze
Matematiche,
Universita
di Siena.
di Ingegneria
Siena,
Italy.
sorbiSunisi.it.
One
of the most
numbers
A and
operator
such
Theorem
Since
are order
exists
Corollary
2.
to true second
is s-reducibility:
where
<I>(5).
of <J>. then D is a singleton,

of the s-degrees
Given
sets
of
<J>is an enumeration
= 0. We show:
or D
is computahly
to
isomorphic
SAN
theoretic
a computable
theorem
yields
to the Q-degrees
isomorphic
function
such
that
A is Q-reducible
C B. for every
(where
also:
The first order theory of the poset
of the Q-degrees
is computahly
isomorphic
order arithmetic.
MAURO
di Lettere,
E-mail:
<J>is an axiom
The first order theory of the poset
the previous
x),
LUCA
reducibilities
to B if A =
order arithmetic.
the s-degrees
number
enumeration
strong
that if (x, D)
if there
Classe
useful
B. we say that A is s-reducible
1.
true second
AND
Scuola
GIORGIO
Normale
VENTURI,
of naturalness
Aspects
Piazza
Superiore.
dei Cavalieri.
in mathematics.
7, 56126,
Pisa,
Italia.
luca.sanmauroSsns.it.
Classe
di Lettere.
Equipe
de logique,
E-mail:
giorgio.
Our
analysis
American
Scuola
natural
it.
with
some
Mathematical
Society):
that would
make
for its peculiar
these
hence
it may
single
common
are
initions.
the
increased
informal
Our
to a large
aware
of the
use
(i.e..
significantly
the
by
"the
archive
that can
be found
is that naturalness
portion
of mathematical
and
"in a
we account
concept"
even
discourse,
the
framework
in mathematical
is an "open
of
of natural
is natural",
proof
Italia
13. France.
of the notion
use of the term "naturalness"
notions
thesis
and
In doing
a formalist
issue,
so.
that
between
this
idea
entails
of mathematical
restrict
two
a strongly
that is intended
position,
theory
we will
we provide
of the concept
is to enlighten
interplay
fact
a third-way
while establishing
concepts
In conclusion,
we claim
dynamic
(provided
decades,
Cedex
practice,
(see
[3]),
in the lack
of a
feature.
this general
development
nal outcome
other
or simplicity.
be applied
well
conceptualist
evidence
on the informal
specifically
but we outline
concepts,
statistical
in the last
Pisa.
7. 56126,
Paris
75205,
there are just a few attempts

of a proper philosophical
references
understandable
(see [2]).
precisely
role among
as pureness
has
dei Cavalieri,
site Chevaleret
Still,
etc.).
we focus
Firstly,
After
literature
Piazza
Superiore,
7 Diderot,
Paris
venturiflsns.
begins
way",
We
Normale
Universite
in mathematical
such
of possibility,
operator
and
symbols
nominals
Italy.
E-mail:
ness
modal
a modal
(i.e.,
logic
features:
marsibilioSunisi.it.
Dipartimento
AND
di Ingegneria
Siena,
to B.
as primitive
hybrid
with the hybrid
order arithmetic.
Dipartimento
53100
of equational
enlarged
be defined.
MARSIBILIO
and second
atoms
We will take equality,
operator).
operator,
in the context
as propositional
our
theory
both
of
from a
concepts.
analysis
instructive
nonplatonic
to be equidistant
to natural
examples
from
axioms
and
the history
natural
def
of logic:
the
of set and
that of the concept

of computable
function.
The fi
the presence
of "theses"
and modify mathematical
that shape
them (as Church-Turing's,
see [1]).
that naturalness
formal
and
can
informal
be fruitfully
mathematics.
considered

as a marker
of the
LOGIC
[1] Stewart
70
Shapiro.
Compulabilily,
Jan
Years
(Adam
Olszewski.
Frabkfurt.
2012,
pp. 420-455.
[2] Jamie Tappenuen.

of mathematical
Mathematical
and
concepts:
Janusz.
Verifiahility.
Logic
Oxford
Verlag.
The philosophy
Press.
university
After
Ontos
editors),
ami naturalness.
fruitfulness
editor),
Thesis
open-texture.Church's
Robert
Mancosu
(Paolo
practice
and
proofs,
Wolenski
237
'13
COLLOQUIUM
2007.
Oxford,
pp. 276-301.
Waismann.
[3] Friederich
Basil
Ryle editor),
JOSE
M.
and
language
Flew
(Antony
and
Gilbert
1951.
Oxford,
GEMMA
MENDEZ,
and depth
AND
ROBLES.
FRANCISCO
Routes
SALTO,
to triviality
relevance.
Universidad
E-mail:
Blackwell,
de Salamanca.
Edificio
FES.
Unamuno.
Campus
37007,
Salamanca,
Spain.
sefus0usal.es.
URL
Address:
//sites.
http:
de Psicologia,
Dpto.
24071,
Leon,
E-mail:
Sociologia
Address:
http:
francisco.
E-mail:
URL
Universidad
y Filosofia,
de Leon,
Campus
s/n.
Vegazana.
Spain.
com.
gemmaroblesSgmail.
URL
com/site/sefusmendez.
google.
Address:
//grobv.unileon.es.
saltoSunileon.
es.
http://www3unileon.es/personal/wwdfcfsa/web/html.
In [4] (p. 435) it is recorded "the class of implication formulas known to trivialize (NC)"
"nai've
abbreviates
(NC
vance"
(dr)
is introduced
strong
naive
set theories
that all implication

Wrms
(wrms).
Ramon
Ministry
T.
Brady.
[3] G. Robles
logics
in [3] and
supported
and
logic.
[4] S.
Rogerson
[5] Z.
Weber.
CSLI.
G.
Dame
MOFIDI.
Institute
for
Niavaran
Bldg.,
Some
Niavaran
in paraconsistent
ir.
mof idiSipm.
In [1], [2], and [3] the notion
studied.
theory are extensively
28494.
financed
is supported
by
by Program
Studia
logics.
vol.
Logica,
43
condition.
Logic,
Journal
set theory.
Deep
relevant
forthcoming.
of Philosophical
The Review
Logic.
of Symbolic
theories.
Sciences
Fundamental
P.O.
structures"
Competitiveness.
to triviality.
cardinals
Square,
FFI2011-
Robles
of Formal
Journal
on NIP
is to prove
model
2006.
Routes
results
in
Research
of this paper
relevant
the depth relevance
Restall.
Logic, vol. 5 (2012). pp. 269-293.

ALIREZA
and
CA.
Generalizing
Notre
vol. 33 (2006), pp. 421-436.

Transfinite
G.
paraconsistent
Stanford.
MCnuez.
in R-Mingle.
and
of some
aim
rele
up nontrivial
with dr.
project
of Economy
Ministry
The
of "depth
in building
used
by "weak
verify logics
by research
the notion
hand,
therein).
Competitiveness.
relevance
and J. M.
not included
they only
of Economy
. Universal
[2 ]
references
in [4] are falsified
Work
Depth
the other
with dr have been
logics
defined
of the Spanish
(1984), pp. 63-73.
Now.
(cf. [2], [5] and
are defined
y Cajal
[1] R.
in [1],
formulas
Acknowledgements.
the Spanish
On
comprehension").
Box
(IPM).
19395-5746
of
Department
Tehran,
Mathematics,
Iran.
E-mail:
their dynamics,
models,
some
results
properties
mathematical
and
vol.
Society,
A. Pillay.
13 (2011).
theory
aspects
of some
on
and
NIP
stability
A. Pillay.
vol.
21 (2008).
On NIP
pp.
and
We
also
with stability
of automorphisms
Keisler
theoretic
points
Groups,
its connections
of action
with
theories.
from the above
them
Y. Peterzil.
Mathematical
Society,
study
in model
different
their interactions
consideration
and
structures
[2] E. Hrushovski
Mathematical
and
characterization
particular
[1] E. Hrushovski.
the American
We study
their orbits,
concerning
with
of measure
measures.
notions
consider
on
We state
by dynamical
some
natural
of view.
measures
and the NIP.
Journal
pp. 563-596.
and invariant
measures.
Journal
1005-1061.

of the European
of
238
LOGIC
[3] H. J. Kcisler.
Measures
and forking.
pp. 119-169.
S. MOJTABA MOJTAHEDI,
E-mail:
Annals
of Pure
and Applied
vol. 45 (1987).
Logic,
The h-provability logic of HA.
of Mathematics,
Department
13
COLLOQUIUM
Sharif
of Technology,
University
Iran.
Tehran,
mojtahedySgmail.com.
Visser. in his PhD thesis [1], introduced a theory HA* which is defined simply as HA
plus
the completeness
Lob
logic
U{A
with new
this result
reprove
A Oha*^-
axiom-schema:
plus the formalized

B) > (A V (A >B)
completeness
is an upper
tools.
With
we completely
characterize
example,
This is joint work with Mohammad
[1] A. Visser.
losophy,
JOACHIM
E-mail:
the
Godel
trace
principle
of HA*.
logic
to prove
further
Here
we
for
results:
of HA.
logic
and
Albert
Visser.
and provability.
PhD
thesis,
ExtensionsPart
Metalogical
bei Heidelberg.
to extend
possible
become
does
not alter
monotony
The
of Phi
Department
I: Propositional
Logic.
Germany.
Our
formalized.
that metalogical
The
loss
like theorem
concepts
of uniform
substitution
and
this fact.
extended
by formulae
to express
apt
that a
is a theorem,
for
Do.
for such
postulates
mathematized.
First,
a metalogical
</> e iff <f>is a theorem
e.g..
The
for all M:
relation
M IN a.
become
logic
Secondly,
implemented
(quasi-)deductively.
self-evident
axioms
and
of model
such
and, specifi
principles
This plan,
6 iff <j> is not a theorem.
-0<t>
(or
valuation
that M IN Da
the Leibnizian
Thereby,
are few general
and
indeed.
concept
11=is defined
extension
(of PL),
be realized
can
semantic-ally:
satisfaction
modal
in a way such
logics
adequately
is inductively
language
instance.
now
we are able
the Ii-provability
NuBloch
nontheorem
cally.
and
Mueller-TheysSgmx.de.
It is perfectly
and
University.
53. 69226
that intuitionistic
> DA
for the provability
tools
Ardeshir
showed
A
1981.
MUELLER-THEYS,
KurpfalzstraBe
bound
these
of diagonalization
Aspects
Utrecht
He
principle
properly
concept
remains
resp.)
iff for every

of necessity
unaltered.
3\f: X IN a.
and
the Carnapian
The
||= a
Finally,
:iff
access
to
too.
in an elegant
new
way.
Our
S has just
system
the following
rules:
a if a is a tautology.
T.
-U<t> ifJ*<t>\
a, a > ft/ p.
a <r+P /
It- a
:iff l~s a.
no use of S5 axiom
By our method
p.
S can
be turned
into a purely
of successive
reduction,
one
a
ME.
extension,
metalogical
namely
ME follow.
ME implies -Oa
ME is also the modal extension
of PL,
logical
modalities
PL-possibility,
Our
theory
G "
being
already
constitutes
properly.
of autoepistemic
extensions
calculus
S'.
we obtain
the main
Unlike
theorem:
(||= a
Completeness
as itunlike,
e.g..
iff
logic
deal
S makes
a solid
In contrast
as
"beliefs
basis
for treating
to the subjective
of agents
with
critical
foundation
like
"a
sets
the
PL-necessity,
(as can
of stable
full introspective
with objective
entities, namely metalogical
we will considermore
generallyfirst-order
and
formalizes
like
of ME
clauses
and only
decidability,
logic,
be shown
^ implies
in the sense
powers",
metalogical
concepts.
In sequel,
consequence
to attempts
of incorporating
the metatheory
immianently.
The theory, developed
is the result of private research
independently,
with Wilfried
513,
there is one
lh a),
S5adequately
by nonmodal
propositional
S5 is a proper subset
Nevertheless,
given
PL-contingency.
and nonnecessitation).
by necessitation
-Oa
syntactic
schemata.
Buchholz.

relations
in close
and
relate
cooperation
LOGIC
VLADISLAV
NENCHEV.
sity. 1164
E-mail:
Sofia.
5 James
er .dev.
lucif
This
paper
Logic.
These
for a couple
relations
dynamic
. which
development
of modal
are defined
combines
U and
A standard
[3]).
[4],
O.
<,
C).
sets in a topological
closed
ordering.
O corresponds
structures
are Kripke
for Contact
and
space
frames
defined
formally
and
over
Cartesian
0.
the stable
Then
and
algebras
(5,
<
C.
U and
of such
products
structures.
underlap.
of O.
C. Their
contact
C)
(see
as the Boolean
Mereotopological
stable
Let
unstable
rela
of the regular
is defined
structures.
and
and
The
language.
algebra
They
theories
Contact
U is the dual
<.
dynamic
[3],
overlap,
with
contact
intersection
with the four relations
be a set of mereotopological
Univer
about
[1], and
spatial
integrated
is the Boolean
algebras
the topological
to nonempty
defined
are
counterparts
are
They
model
Sofia
logics
in [4],
point-free
and "sometimes",
in one
like "always"
temporal
properties,
are stable and unstable
versions
of part-of.
tions in question
(denoted
relations.
Informatics.
Bulgaria.
results
decidability
relations.
and
com.
OSgmail.
a Whiteheadean
represent
Blvd..
contact
logics for dynamic
of Mathematics
Faculty
Bourchier
presents
mereotopological
of modal
Decidability
of Mathematical
Department
239
13
COLLOQUIUM
and
unstable
</. O,. U,)
(W:,
contacts
are defined
x C y iff(Vi /)(.v, C, yi). x C3 y iff(3/ G I){x, C, y,). <v. <3. Ov. O3. Uv and U3 are
defined similarlyin [1],
Stone-like
representation
and
is presented
in [3], [2], and

while
relations,
, O3.
The
U3).
the modal
Here
add
shows
contact
two logics
Vladislav
Journal
European
Advances
und Logical
[4] Dimitcr
I. Stable
and
no.
pp.
1-4.
ISABEL
Dept.
E-mail:
logic
Vakarclov.
is obtained
type
finite model
and
more
reducts.
Uv. <3.03.
in which
of
we
in which
U3, C3).
<3
away:
via filtration,
which
we
when
is proved
take
property.
unstable
relations.
mereological
no. 6. pp. 1354-1379.

A modal
logic for
mereotopology:
. Copenhagen.
relational
Central
Denmark.
for stable
Logics
mereotopology:
stable
and
unstable
2012.
and
unstable
relations.
to appear.
Philosophy,
unstable
0V.UV,<3
the decidability
vol. 9 (2011).
relational
. Dynamic
[3 ]
Ov.
the decidability
for stable
Logics
in modal
cases
logic
(W, <v,
in [1], while
of two
logics
(W. <v.
frames
second
strong
of Mathematics,
. Dynamic
[2 ]
relations.
posses
Nenchcv.
The
relations
of all eight
problem.
for modal
In both
U3, C3).
contacts:
shown
for distribu
dynamic
of the modal
the dynamic
is also
theory
for these
logics
the completeness
logic
first are
is omitted.
Uv, Cv. O3.
that these
[!]
Logic
Cv
The
modal
without
results
decidability
contacts.
and
is still an open
for the full system
we present
Ov.
the reducts
of their modal
decidability
the dynamic
(W. <v.
[2] shows
[1].
[1] considers
logic
the stable
for first-order
completeness
of the representation
(a generalization
theory
tive lattices)
Dynamic
A point-free
mereotopology:
relations.
mereotopological
Fundamenta
theory of changing
Informaticae.
vol.
regions.
100 (2010).
159-180.
A recursion-theoretic
OITAVEM.
FCT.
Matematica.
oitavemSfct.
Universidade
unl.
approach
Nova
to NP.
de Lisboa.
2829-516
Caparica.
Portugal.
pt.
We give a characterization
of NP using a recursion
scheme with tier 0 pointers.
This extends
characterization
of Ptime and. simultaneously,
it is a restriction
of a
the Bellantoni-Cook
characterization
recursion-theoretic
of Pspace.
A new recursion-theoretic
and S. Cook.
characterization
of poly time
[1] S. Bcllantoni
vol. 2 (1992),
Complexity,
pp. 97-110.
functions.
Computational
with pointers. Mathematical
vol. 54
121 I. Oitavem.
Characterizing
Pspace
Logic Quarterly,
(2008), no. 3. pp. 317-323.

. A recursion-theoretic
[3]
vol. 162 (2011). no. 8. pp. 661-666.

SERGEY
OSPICHEV.
Novosibirsk
E-mail:
State
semilattices
Rogers
University.
ospichevSgmail.
approach
2 Pirogova
to NP.
Annals
of finite families
Str.. 630090.
of Pure
in Ershov
Novosibirsk.
and
Applied
hierarchy.
Russia.
com.

Logic.
240
LOGIC
Main
area
hierarchies
semilattice
in numbering
of research
The
[2],
to some
isomorphic
Let S be the family
more
=
of sets. S
is studying
theory
of this work
goal
to construct
was
or less known
in different
semilattices
Rogers
of E,7'-sets
family
[1] with
Rogers
object.
Define
A/Cw.
B},
{A,
13
COLLOQUIUM
vM:
a numbering
G M:
B,n
vM=A,niM.
In work
are proven
Theorem
1. Let S
{A,
2.
Theorem
Let
be the family
B}
S is 1,7' -computable
family
iff M
{A,
B}
Lemma
notation
notations
3.
of even
Let
1.
If the numbering
There
c.e. sets
vM offamily
S isY-a
-computable
c.e.
with A
ordinals
vM of family
S
with A C
B.
aordinal
iff M
is proven
of nonempty
~1
is E
vM of
Numbering
a.
of nonempty
he the family
are family
notation
Numbering
{A. B}
for any even nonlimit ordinal.
2.
c.e. sets.
nonempty
be the family
notation for any odd or limit ordinal.

For ordinal
of disjoint
G AJ1 for any ordinal
with the above
then M
-computable
and
properties
sets
set
1,71.
'
suc^
B.
aordinal
that
yM 's not
-computable.
I7'
The
was
study
Russian
supported
Federation
the
by
of
Ministry
by the Grants
and
8227)
(project
Education
Council
Science
of
President)
for
and
RF
(under
State Aid of Leading ScientificSchools (grant NSh-276.2012.1).

[1] M.
M.
Arslanov.
Ershov
[2] S. S. Goncharov
vol.
Mathematics,
FEDOR
PAKHOMOV,
E-mail:
pakhfnmi.ras.ru.
It is well
nition)
The
artificial
constructive
Lev
ordinal
as the set
Also
there are subsystems
In this talk
I will describe
ticularly,
iffa < 4.
[ 1] L. Beklemishev.
famous
functions.
(0),
ordinal
of elementary
signature
< w the elementary
Provability
ordinal
algebras
notation
GLP.
system
functions
with -< order
(0),(1),...,
Lee.
A comparison
of well-known
ordinal
notation
and Applied Logic, vol. 147 (2007), no. 1, pp. 249-290.

[3] F. Pakhomov.
Sbornik
Mathematics,
Undecidability
vol.
203
of the elementary
(2012),
no. 8, pp.
proposed
a>
(n),
oj"j^
n times
After that I will discuss
of (WQ,
ordinals,
systems
by
this system
type
it will be partially
and proof-theoretic
sys
based
system.
for structures
that were mentioned
theory
sys
of natural
notation
We consider
based
I. Annuls
of Pure
eo- Annals
theory of the semilattice

Par
is decidable
for
141-160.
above
on [3].
(0),...)
Applied Logic, vol. 128 (2004), no. 1. pp. 103-123.

[2] G.
notation
for eo is the system
notation
theory
modifications;
that for a
constructive
only
ordinals
proof-theoretic
ordinal
logic
1))
style defi
of properties
system
Peano
currently
a study
type e0 and unary
(1(n
But
system.
of a natural
We consider
from provability
Beklemishev's
with some
we proved
Several
-< with order
(W,
definition
most
(in Gentzen
nonstandard
giving
The
comes
system
notation
is important.
[2].
ordinal
of this situation,
Because
addition
with decidability
for structures
system
systems
and
[ 1 ]. This
ordinal
are no general
proposed
with well-ordering
the situation
and
notation
eo were
exponentiation
Beklemishev
Contemporary
of first-order
ordinal
of a proof-theoretic
notation
this uncertainty.
up to ordinal
eo is the proof-theoretic
of constructive
there
Nevertheless,
tem that resolves
on omega
the ordinal
of a calculation
of ordinal
examples
are known.
tems
that
result
on the choice
depends
2007.
University,
open problems.
of some ordinal notation systems.

str. 8. 119991
Russian
Federation.
Moscow,
Gubkina
Institute,
known
Arithmetic.
State
theories
Elementary
Mathematical
Kazan
of numberings,
Theory
pp. 23-38.
257,
Steklov
Kazan.
hierarchy.
S. Badaev.
and
and
of Pure
of GLP-words.
LOGIC
LAVINIA
PICOLLO,
Philosophy
Aires
Department,
of Buenos
University
in first-order
480
Aires,
Peano
Puan
arithmetic.
Street,
Buenos
C1406CQJ.
City, Argentina.
E-mail'.
all
semantic
appearance,
There
discussion.
available
unclear
1 show
in the literature
for any first-order

for primitive
I consider
recursive
some
CHRISTIAN
logic
and
IRIT
E-mail,
christian.
When
the parse
sitional
as
I provide
in the
languages
such
notion
containing
enough
symbols
of the diagonal
lemma.
Finally,
semantics:
language
118, route de Narbonne.
and
logic
and
sorted
many
31062
Toulouse
we enrich
our
in F are rather
ontological
inclusions
Let
one
like "cars"
order
as
logic
over two
the other
logic
target
selection
propo
calculus
logic
lambda
the target
(to leave
logic:
is
usually
calculus
The
logic.
out sentences
is an important
harbour
and votes
"Liverpool
is an important harbour and won eighteen
Those
Hilbert
base
many
with predefined
are "vehicles")
and adapt
(which
types.
(generalised)
finite and
e.g..
types,
subtyping
lead
naturally
over
uniformly
to express
operators
coercive
(or sorts)
types
that act
operations
type system
and
order
restrictive
combines
intuitionistic
"Liverpool
to factor
dull)
like
target
use of second
higher
which
logic
lambda
typed
formula,
them in accordance
being
us call
makes
many-sorted
to use typed
(encodings
is simply
as a logical
glue
terms
of the sentencethe
framework
club).
in order
types
this logic
to reject
The
logics.
propositions).
to accept
whistles.",
combines
the lambda
types is to model
base
many
depicted
and
two
involves
calculus,
Our
logic.
of a sentence,
formulae,
the meaning
(location/football
over
Here
(or
to represent
it is fairly natural
setting,
tion.
truth-values
used
the glue
table
titles,
League
version
Sabatier,
the meaning
semantics,
(location/people)
quantify
paradoxes.
arithmetic
for natural
that are partial

process
Montague
for having
"The
labour."
This
or first order
F)
(system
motivation
semantic
for formal
fr.
this is a lambda
and
are
order
senses,
structure.
entities
higher
of reference
formal
be employed
France.
compositionally
proofsin
types,
notion
a strong
Paul
retoreffllabri.
formulae:
its formulae
should
http://www.labri.fr/perso/retore.
computing
the partial
self-referencefor
of reference
of Peano
framework
Universite
one starts from the word

with
thus,
its first
At the bottom
in type theory.
de Bordeaux)
universite
Address',
to address
to prove
A natural
operators
MELODI,
Equipe
sound
made
paradox
this issue.
difficulties.
RETORE.
9. (&
Cedex
notion
of the language
functions
possible
Hilbert
is no
that is useful
extension
Yablo's
about
of referenceand.
on which
there
Since
in a debate
engaged
notion
is no consensus
Moreover,
self-reference?
have
philosophers
there is an
languages.
involve
paradoxes
many
of the debate
URL
com.
lavipicolloQgmail.
Do
like
and self-reference
Reference
241
13
COLLOQUIUM
to
In such
countable
sets
is welcome
for representing
operators
to this extended
Hilbert
quantifica
type system.
GEMMA
ROBLES.
Lukasiewicz
A Rout ley
3-valued
de Psicologia.
Dpto.
Leon,
24071,
Meyer
semantics
and
for truth-preserving
well-determined
logics.
y Filosofia.
Sociologia
Universidad
de Leon.
Campus
Vegazana.
s/n.
Spain.
com.
gemmaroblesQgmail.
Address:
unileon.
es.
http: //grobv.
3-valued
Lukasiewicz
logic L3 is often understood
E-mail:
URL
to Lukasiewicz
sider
L3b
stood
3-valued
two alternative
defined
matrix
by two different
Meyer's
vide
a Routley-Meyer
Lukasiewicz
basic
positive
3-valued
logic
L3.
formulas,
B+.
L3a
and
following
Wojcicki
formulas
(cf. [2]).
and
matrix
for each
the aim
one
according
we shall
con
"well-determined"
ML3.
in [1] as an extension
on this fact,
semantics
L3a
on the 3-valued
is axiomatized
Leaning
relational
as the set of all valid
"truth-preserving"
relations
consequence
ternary
logic:
In addition,
of L3:
interpretations
as the set of all ML3-valid
and
ML3.
L3.
under
of Routley
of this paper is to pro

three versions
of
of these
L3b.

242
LOGIC
Work
Acknowledgements.
Spanish
Ramon
y Cajal
F. Salto.
J. M.
DOI
(2013),
on propositional
Nonstandard
two-valued
3-valued
L3.
logic
under-determined
Journal
of Philosoph
Ossolineum.
calculi.
Wroclaw.
Poland.
1984.
is computable.
281.
Krijgslaan
9000
Gent.
Belgium.
Philosophy.
sasanderQcage.ugent.be.
Address:
To date,
calculus
of physics
practice
which
functions
producing
sasander.
be/""
//cage.ugent.
http:
the mathematical
and
are independent
F:
where
x R ->
infinitesimals
if *F(x,
R is a standard
e) describes
part
and
function
to be merely
are believed
calculus
of physical
infinitesimal
of the infinitesimal
as follows:
*F(.r,e)],
*F
tools
(1)
is its nonstandard
without
the choice
reality,
is an informal
engineering
of the choice
(V.* 6 R)(Ve,e' 0)[*F(x,e)
sense
by the
by Program
Competitiveness.
equivalent
Why physics
Analysis:
Department
University,
Munich
Center for Mathematical
URL
Dual
of Mathematics.
Ghent
E-mail:
Mendez.
financed
is supported
Robles
10.1007/S10992-012-9264-0.
Lectures
SANDERS.
and
of Economy
for Lukasiewicz's
interpretations
[2] R. Wojcicki.
SAM
and
FFI2011-28494.
project
- G.
Competitiveness.
Ministry
and over-determined
Logic.
and
of the Spanish
[1] G. Robles.
ical
by research
supported
of Economy
Ministry
'13
COLLOQUIUM
extension.
real world
of e must
Indeed,
existence;
Especially
as common
be irrelevant,
dictates.
The
independence
(1)
property
rise
gives
an
to Sl-invariance,
nonstandard
equivalent
definitionof Turing computability ([2]).

Definition
6 Ao and
1. For <p{n, m)
w 6 fi. the formula
Here.
N) is the set of nonstandard/infinite
*N (resp.
As
an
let
application,
formulas.
Given
Q-invariant
fi-CA
fi-CA
if
is fl-invariant
(n.io) -> *i//(n./)].
(Vn N)(Va/
n = *N\N.
*i//{n,u>)
"
and
the
as
in (1).
numbers,
finite/standard)
(resp.
be
F
(2)
comprehension
there
and
for
principle
is standard
G:
> R such
that
G{x)].
(Vx R)(Ve 0)[*F(*,e)

fi-CA
Thus,
standard
rise to a computable
gives
part
(3)
In general,
map.
the latter
is highly
noncomputable ([1]).
we discuss
Finally,
nonstandard
fi-CA
This
Acknowledgement.
tion and
how
reduces
the coding
in Reverse
and
Mathematics,
the role of
definitions.
[1] H.
Jerome
[2] A.
Montalhan
is generously
sponsored
Foundation.
research
Von
the Alexander
Keisler.
by the John Templeton
Founda
Humboldt
arithmetic
Nonstandard
and
reverse
this Journal.
mathematics,
vol. 12 (2006). no. 1, pp. 100-125.

preparation.
DANIYAR
and
S. Sanders.
Circular
SHAMKANOV,
Steklov
Mathematical
E-mail:
daniyar.
In this talk
R. Solovay's
shamkanovQgmail.
we present a circular
landmark
lot of effort has

(see
circular
Analysis
and
Turing
In
computability.
result
(see
been
directed
logic.
proofs for provability
Gubkina
Institute,
where the modal

interpretation,
is provable
in Peano
arithmetic".
logic
Nonstandard
2012.
8. 119991.
Russia.
Moscow.
com.
proof
[4]) states
system
for the Gddel-Lob
that GL is sound
and complete
GL.
provability
logic
under
arithmetical
"A
OA is interpreted
as the provability
predicate
operator
Thus properties
of GL has attracted
strong interest and a
cut-free sequent
to the search of an adequate,
system for this
[2. 3. 1]). We present a sequent-style

In contrast
to ordinary
proofs.
proofs,
for GL obtained
proof
system
which
are simply
derivation

by admitting
trees, a circular
LOGIC
can
proof
be formed
with an identical
with respect
cut-free
and
rules,
where
the
how
Lyndon
[1] R. Gore
and
from
be obtained
from these
by direct
systems
A purely
syntactic
and
of Symbolic
Provability
THEODORE
AND
of Mathematics.
Department
The
slamanQmath.
Siena.
34 (2005),
for the modal
logic
of
Israel
logic.
SORB!.
Journal
Downwards
of Mathematics.
and
density
incompara
degrees.
of California
at Berkeley.
CA
Berkeley.
94720
edu.
berkeley.
di Ingegneria
Dipartimento
vol.
no. 4. pp. 593-611.
of modal
University
3840. USA.
resolved.
logic
Logic,
calculus
sequent
2 (2009).
ANDREA
of the enumeration
segments
for provability
of Philosophical
cut-free
interpretations
A. SLAMAN,
bility in initial
Journal
vol.
Logic,
cut-elimination
no. 2. pp. 212-238.
logic.
The Review
Solovay.
Vulentini's
5 (2012).
in modal
vol. 25 (1975). pp. 287-304.
E-mail:
can
we give a syntactic
proof
from [2, 3. 1] contain
inference
the conclusion
to the premise.
systems
polarity
analysis
Proof
[3] F. Poggiolesi.
53100
assumption
and
As an application,
changes
vol.
Logic,
of Symbolic
[2] S. Negri.
E-mail.
open
is sound
complete
that it is contraction-free
and
of GL.
that sequent
interpolation
R. Ramanayake.
pp. 507-544.
[4] R
each
system
argument.
proof-theoretic
provability.
are invertible.
Notice
formula
principal
it is unclear
The Review
rules
for GL.
tree by identifying
that the circular
formulation
sequent-style
that its logical

interpolation
derivation
We prove
sequent.
to the standard
of Lyndon
Thus
from an ordinary
interior
243
'13
COLLOQUIUM
dell'Informazione
e Scienze
Matematiche.
Universita
di Siena.
Italy.
sorbiQunisi.it.
It is known
that there
is no minimal
enumeration
We improve
degree.
on this result
by
showing:
Theorem
1. Below
every nonzero
enumeration
one can embed
degree
every countable
partial
order.
The
result
Theorem
interval
is in fact a particular
2.
If a b are
(a, b). one can embed
THOMAS
description
Informatik
und
Neubruckstr.
tstuderQiam.unibe.ch.
E-mail:
wernerQiam.unibe.ch.
information
Hiding
However,
often
defining
because
and
knowledge
to grant
cope
with
for propositional
several
advantages
structure
boolean
also
issues
in a selective
information,
version
is crucial
Universitat
e.g.
parts
Bern.
of the digital
age.
expressive
propositional
relational
information
logic.
we adapt
not only selective
to disclaim
of information.
Moreover
possession
have in the propositional
that censors
setting
censored
knowledge-base
and
inferred
by the querying
agent.
the inability
to protect
Also
information
the approach
[2],
but without
capabilities
negative
as atomicity
a set of secrets
prove
to model
the
statements,
but
to get rid of several

requirements
if its disjunction

to have
the incomplete
property
means
in [1]
presented
which
it possiblein
they provide
such
leakage
side
by utilizing
it is sometimes
wishful
enough
make
and
information
Mostly
logics
provide
and
collections.
data.
description
They
data
not to be answered
information
of personal
of that personal
to the more
express
needs.
queries.
statistics
modern
that are simply
to infer hidden
allowed
from
gathered
this challenge
we useto
in Boolean
knowledge
Group.
to most
to related
is still able
to infer sensitive
over
Theory
of information
or unsatisfying
to inferable
of complicated
b. then in the degree
<
Censoring
and
manner
agent
logic
WERNER.
or subsets
query-patterns
a querying
information
it possible
making
To
access
Switzerland.
to be insufficient
proves
occurs
and
order.
partial
MathematikLogic
Bern.
E-mail:
with a total,
degrees,
JOHANNES
angewandte
10. 3012
of the following:
every countable
AND
STUDER
logic.
case
enumeration
in the
can
be
244
LOGIC
In order
need
to apply
very involved
a cooperative
Moreover
censoring
demonstrate
that
Biskup
Journal
[2] Franz
and
Baader.
F. Patel-Schneider.
Press,
New
of isolated
Sobolev
Institute
E-mail.
URL
mulas
1. For
to isolating
State
regular
T.
theory
of labeling
3.
a nonempty
v(R)
4.
Theorem
for
Technical
Univer
Russia.
and
minimal
S'(0)
of isolated
the POST
u has
a complement
and
types,
u such
that
{MrlR),
for which labels
Cm-structure
then the monoid=
algebra,
for
semi-isolating
theories.
formulas,
label
{p}
any
labels
and zero, and each
V u correspond
POST
labels
theory
and
zero, each
is positive or zero and

R C 5' (0),
and a
= 9Jt.
such that
family
family
labels
5' (0),
the POSTC'n-s
formulas,
of which dominates
dominated
many
label
formulas
a nonempty
T,
u.
types, and a regular

that Z0ir(R) = SOT.
a nonempty
for semi-isolating
functions
with finitely
label
T.
of isolated
such
for semi-isolating
minimal
strongly
of positive
theory
and
S'(0),
or zero and has a
is positive
in which each
Cn-structure
functions
label
R C S](0)
the POSTC?z-struclure
u has a complement
label
in which each
family
family
formulas,
for semi-isolatingformulas
of labeling
and each
a nonempty
T,
theory
T, a nonempty
of labeling
v (R)
consists
labels,
many
each
If R =
there is an w-categorical
For
5.
family
and
for semi-isolating
functions
of positive
For any finite

v{R)
regular family
family
by a Boolean
co-categorical
any
of labelingfunctions
Theorem
formulas
theories.
State
isolating
strongly
for semi-isolating
For any POSTCn-structure
has a complement,
regular
is generated
there is a theory
complement,
family
semi-isolating
minimal
Novosibirsk,
and
categorical
functions
of labeling
OT,.(fi) is finite, consists

Theorem
and
University
of p.
For
v(R)
family
Inter
Nardi
Cambridge
Novosibirsk
University,
ru/~ sudoplatov/.
for distributions
of binary
of countably
of labels)
2.
databases.
Daniele
handbook.
of binary
Russia;
Novosibirsk,
approach
formulas
Corollary
to
199-217.
McGuinness.
and strongly
categorical
and zero,
labels
of positive
9JI,.() consists
u A u = 0 and u V u is a maximal
element.
(for compositions
forced
ru.
any
v(R)
family
be
nsc.
//math.
a general
Theorem
L.
logic
of distributions
Novosibirsk
Russia;
[1, 2] to the classes
regular
we
We present
in any situation.
always
in incomplete
no. 3, pp.
Deborah
Algebras
of Mathematics,
http:
We apply
secrets
Keeping
The description
types, for countably
sudoplatQmath.nsc.
Address:
can
censor
a rich logic,
agent.
2003.
NY,
sity, Novosibirsk,
to such
any set of secrets
a truthful
7 (2008).
vol.
Calvanese.
editors.
SUDOPLATOV,
families
Weibert.
Security,
Diego
Peter
SERGEY
Torben
of Information
York,
to defend
since
refusal
state of the querying
behavior.
unwanted
[1] Joachim
is essential
lying
lying and
involving
the epistemic
that is capable
but lying censor

we show
national
techniques
to model
techniques
13
COLLOQUIUM
and
true lure
many or co-finitely
not force infinite definable
finitely
does
sets.
Theorem
6.
For any POSTCn-structure
TO, in which each
nates finitely many or co-finitely
many labels,
does
sets, there is a strongly
not force
R C S' (0),
infinite definable
and a regular
family
v (R)
and each
of labeling
label
label
is positive
or zero and domi
with finitely
many dominated
theory T. a nonempty
minimal
functionsfor
semi-isolating
formulas
labels
family
such that
mrlR)=m.
[1] I. V. Shulepov
formulas
[2] S.
complete
SERGEI
Centro
fessor
E-mail:
URL
and
of a complete
V. Sudoplatov.
theory.
arXiv:
S. V. Sudoplatov.
theory.
Algebras
Algebras
1205.3473vl
[math.
constructive
for
Pinto
ordinals
ul.
pt/~
binary
and ordinal
e Aplicagoes
Fundamentais,
2. 1649-003
Lisboa,
Portugal.
sergeiacs.ioc.ee.
Address:
//www. ciul.
http:
for
binary
isolating
L0].
semi-isolating
formulas
of a
L0].
de Matematica
Gama
of distributions
[math.
of distributions
1210.4049vl
Abstract
TUPAILO,
arXiv:
Universidade
notations.
de Lisboa.
logicmat/.

Avenida
Pro
LOGIC
Ordinal
whose
is one of the central
notations
primary
was connecting
goal
of certain
O and
both
the relation
set-theoretical
The
methods
like reducing
theories
In the recent
it is a variant
question
arises
We show
decidable.
machine
This
how
work,
it is.
[2] W. A.
terms,
While
information,
of those
results
interpretation.
For
of Kripke-Platek
but
constructive
their
set theory
[2], An obvious
from
ordinal
{|.s|
O of ordinal
| s, t O}
the halting
<
|f|
to code
with F. Ferreira
of the -ordinal
of KPco.
constructive
Information
2012,
so,
E-mail.
Eurasian
In paper
[1] authors
showed
University.
that for each
but not relatively
S. S. Goncharov
language.
Astana.
of a Turing
J. Avigad.
preprint.
The Journal
of Symbolic
where
This
the method
of definability
bounded
arity of them
structure
by finite number
is preserving.
We considered
the structures
graph such that categoricity
of the symmetric
i = 0,1,2
where 00 signature
irreflexive graphs,
and
linear
ordinal
computable
Theorem
a.
For the proving
of signature
this result
a i that is A categorical
Theorem
2.
S.
For each
relation
[1] J. Chisholm.
Miller.
Intrinsic
Symbolic
Logic,
E.
<7,, where
i =
for the nilpotent
of the next signatures

signature
0\ consists
B. Fokina.
vol. 74 (2009),
there is a computable
I but not relatively
S. S. Goncharov.
on complexity
no. 3, pp.
Mekler's
0,1,2.
ordinal a
computable
R that is intrinsically
bounds
we used
group
ordinal a there is a computable

computable
but not relatively A (and without formally
1. For each
a, with additional
with countable
to the oriented
of the nilpotent
For the classes
of
02 of the signature
group.
that categoricity
is preserving
we proved
for the
07, i = 0,1,2
coding [3],
Let A structure
that
relational
order,
of the signature
structures
is a structure
there
of the countable
structure
oi,
equivalence
5, Kazakhstan.
Munaitpasova
ordinal
computable
A categorical.
[2] suggested
set of predicates
computable
not
ru.
tussupovOmail.
is A categorical
National
[2]
even
structures.
of the algebraic
Categoricity
Systems.
notation
of [1] and
not
problem
and
ordinals.
terms
are
Logic, vol. 37 (1972), no. 2. pp. 355-374.

J. A. TUSSUPOV,
is very
built-up
ordinals
different
the systems
it's possible
of abstract
A system
functional
essentially
the relations
A new computation
Howard.
some
re-proving
notations,
ordinal
as an |.s| < |/| question.

work has arisen thanks to correspondence
[1] F. Ferreira.
for infi
techniques
additional
analysis.
the case.
those
using
in that
for the
|r| standing
collapsing
in the case
of abstract
mathematically,
primitive-recursive,
Indeed,
use
on
Goedel's
be done
does
sets.
they provide
research
from
system
in ordinal
used
some
it can
too,
that this is, indeed,
obviously
been
and
usually
of the set
ones.
originating
of Howard's
whether
traditionally
systems
has
[1] shows
Ferreira's
Infinity.
cut-elimination
consistency,
feature
its primitive-recursiveness,
is, always,
to intuitionistic
including
different,
are
there
years
A distinctive
numbers.
theory
to well-foundedness
theories
are primitive-recursive
O}
often, employ
from mere
Apart
by different methods,
F. Ferreira
example,
with
|t| ].?,/
{|.?|
of a term t.
here, most
classical
of natural
a part of proof
analysis,
of mathematical
involved
<
meaning
nite derivations.
ordinals
of ordinal
ingredients
consistency
orderings
primitive-recursive
O C IN of codes of recursive
245
13
COLLOQUIUM
and
structure
structure
intrinsically
V. S. Harizanov.
at limit
definability
A of signature
Scott family).
A of signature
1 on A.
J. F. Knight,
levels.
The
Journal
and
of
1047-1060.
models. Proceed
and definable relations on computable
Isomorphisms
[2] S. S. Goncharov.
2005, Athens, pp. 26-45.
ing of the Logic Colloquium
The Journal
Stability of nilpotent groups of class 2 and prime exponent.
[3] A. H. Mekler.
of Symbolic Logic, vol. 46 (1981). pp. 534-562.
MITKO
Faculty
Bourchier
E-mail'.
YANCHEV.
Integer
of Mathematics
Blvd..
1164
yanchevQfmi.
and
Sofia,
uni-sof
and rational
Informatics.
grading
Sofia
interaction
University
"St.
in Description
Kliment
Bulgaria.
ia.
bg.

Logics.
Ohridski",
5 James
246
LOGIC
in the
Adding
formalism
logical
sentation.
intended
new
of such
meaning
of an
object
(0,1).
These
operators
operatorsor
Description
of the
enrich
essentially
Modal
Logic
specialized
inference
engine
also
(or
the expressive
are
repre
is introduc
quantity
have
some
r part
of all suc
number
rational
arbitrary
sense.
qualitative
than
smaller)
r is an
where
property,
latter
knowledge
to express
which
grading
The
for explicit
of a
ability
is that bigger
operators
some
possesses
systems
for (integer)
operators
(DLs).
Logics
by means
knowledge
for rational
operators
cessors
counting
and
in the development
step
ing in the language

The
called
Modal
in knowledge-based
used
for inferring
natural
so
in both
widely
and
([1]).
the
language
fruitful
gradingproved
13
COLLOQUIUM
in
of the corresponding
capabilities
languages.
Generalized
and
Graded
rational
have
"scalable"
in their
syntax
modal
having
its counterpart
also
problem.
At
languages,
come
satisfiability
PSPACE-complete
more
ing
grading
(GGML),
hence,
(and
in
that
for both
operators
DLs,
time
Description
different
under
integer
is proven
ACCQV)
to
allow
Logics,
classes
complexity
as well.
We have
atomic
the Description
explored
constructors
and
atomic
negated
of a concept,
can
between
subsumption
be decided
limited
i.e.. formulae.
in polynomial
DL
the "core"
extending
called
grading,
concepts,
task in DLsthe
reasoning
ACPE
Logic
for rational
(operators)
We have
hence
conceptsand
adopting
that in ACPe
shown
time, independently
with limited
AC
restrictions,
part
also
only
the main
the satisfiability
of the notation
for numbers
in part restrictions.
In the present
number
both
interacting
extra
we consider
and
integer
cost
and
than the previous
and
the satisfiability.
based
on tableau
as it is obtained
For achieving
of
no
almost
of the complexity
this we use a sophisticated
The
of unary
for
power
brings
bound
upper
technique.
in the case
just
P-time
constructors
the expressive
possessing
that this expressiveness
the same
keeps
with
ACAfV.
Logic
restrictions,
We show
grading.
calculus
one,
Description
part
as ALNVe
the subsumption
of completion
the
limited
rational
of complexity,
of checking
version
talk
restrictions
result
is in some
way weaker
of numbers
coding
in grading
constructors.
[1] F.
Baader.
editors.
D.
New
Press,
University
D.
Calvanese.
The description
McGuinness.
logic handbook:
BADAEV,
Department
of
71 Al-Farabi
Ave.,
E-mail:
of talks
and
semilattice
properties
Al-Farabi
Mechanics,
but
one-element
If A consists
maximal
for every
We
low
of A
[2], This
element,
notations
are intersted
semilattice
hierarchy.
University,
n. and
hierarchy,
property
of
I^'-computability
that the Rogers
semilattice
7l~1
{A)
In particular, if 7?."' (.4) is infinitethen TZ^,](A)

of all singletons
of to then the Rogers
segments
can
of7?j"'(-4)
in the properties
of the
{Ci,
one-element
General
National
is
semilattice
has no
IZîA)
for
all
ordinal
'(4)
lifted to
be easily
then 7?.j~' (.4)
a.
levels
m >
the other hand, for example,

if A consists
'
(.4) is infinite for every m > 1.
of all finite initial
in the Ershov
kz.
is isomorphic to an ideal of 1Z^]{A).

On
Cambridge
Kazakhstan.
050038,
Almaty
BadaevSkaznu.
its I~'-computability
is infinite too.
P. Patel-Schneider,
Kazakh
We refer to [1] for the necessary

notions
and notations.
in the Ershov
For any family A of sets from a class I^1
A implies
and
and applications.
by title
presented
of the Rogers
Lifting
Mathematics
Serikzhan.
Nardi,
2003.
York,
Abstracts
SERIKZHAN
D.
Theory, implementation,
Ershov
of c.e.
C2}
while
hierarchy
sets such
1Z^]
can
that
ones.
the
Rogers
as
follows.
semilattices
For
which
instance,
semilattices
could
we
7j~' (A)
be lifted from
construct
and
a family
TZîA)
are
is infinite.
(A)
problem
7?."' (.4)
of the Rogers
to higher
be
formulated
of a family
A C I"1.
How
long
Let
V could
be a property
of the Rogers
be lifted, i.e., up to what h does

LOGIC
the property
and
a <o
V hold
Badacv
and
Mathematics,
[2] Yu.
JOHN
Here
(.A)?
a. b are the ordinal
notations
of computable
ordinals
b.
[1] S. A.
porary
in lZh
247
13
COLLOQUIUM
L. Ershov.
E-mail,
257
basic
syllogisms:
at Buffalo.
of numbering.
Nauka.
of numbering.
Aristotle's
University
Theory
Open
Contem
problems.
pp. 23-38.
(2000).
Theory
CORCORAN.
Philosophy.
S. S. Goncharov.
vol.
NY
Buffalo.
1977
Moscow.
(in Russian).
and extended.
14260-4150.
USA.
corcoranflbuffalo.edu.
Aristotle's
basic
the
of two sorts:
conclusion
or moreand
premisestwo
sitions
are
syllogisms
or extended,
often
"linking"
propositions
and
from
An
conclusion.
extended.
the
extended
is just
syllogism
further
does
propo
the further
syllogisms,
the conclusion
indeed
whether
syllogism,
basic
contains
syllogism
In some
evident"showthat
In every
premises.
extended
to conclusion.
premises
"make
help
basic
follows
follow
from the
premises.
Each
two
extended
share
further
syllogism.
basic
Every
sets,
below
basic
discussion
Aristotle,
those
forms.
proposition
is needed for the implication

devised
Aristotle
in each
evident
Applying
extended
complete
also
relation:
or extendedit
syllogismbasic
are
that (1) the

is obtained
of the extended
those
having
complete
extensions.
property:
is an epistemic
syllogism
which
the premises.
which
syllogism
is the base of a
syllogism
basic
[per-impossibile)
or syntactic
reductio)
from
an extended
basic
that every
and
follows
produces
incomplete
proved
basic
two-premise
conversion
(involving
syllogism
infinite
largeeven
no further
(or perfect):
complete
in the other twenty are incomplete.
the conclusion
every
is evident
base
indefinitely
that
indirect
completeness
syllogism
in the twenty-four
process
cases
basic
is a structural
categorical
Being
has complete
with
to those
Indeed,
in the sense
syllogismthe
in four forms
Aristotle
syllogism.
extensions
informational
sense.
basic
syllogism
the extended
extensions.
completion
of the twenty
in Aristotle's
the
basic
(2)
to be evident:
to an incomplete
completion
is complete
direct
a deductive
and
syllogisms
restrict
categorical
makes
For
into
has many
considered
we
of a unique
conclusion
propositions
syllogism
Aristotle
Although
and
premises
by interpolating
premise
is an extension
syllogism
the same
is a semantic
following-from
or cognitive
that the conclusion
follows.
or
In any complete
property.
This
lecture
continues
discussions in [1] and this Bulletin, vol. 10 (2004). p. 289: vol. 13 (2007). pp. 382-386; vol. 14
(2008). pp. 155-156: and vol. 16 (2010), p. 136.
[1] John
Corcoran.
of an ancient
Completeness
vol. 37 (1972), pp. 696-702.

JOHN
AND
CORCORAN
Philosophy.
E-mail
WILLIAM
at Buffalo.
University
Cosmic
FRANK,
Buffalo.
NY
The Journal
logic.
Justice
14260-4150.
of Symbolic
Logic,
Hypotheses.
USA.
corcoranbuffalo.edu.
This
and
clarity
lecture
applied-logic
understanding
builds
on [1] arguing
in ethics,
confirming
that character
hopeful
traits fostered
views
of Alfred
by logic
Tarski
serve
[2. Preface,
in one strict usage are propositions

not known
Hypotheses
to be false ormore
so considered
for
looselypropositions
and
personal
communication].
to be true and not known
discussion
[1. p. 38].
purposes
their implications
Logic studies hypotheses
by determining
(propositions
they imply) and
their implicants
that imply them).
(propositions
Logic also studies hypotheses
by seeing how
variations
and implicants.
affect implications
versed in logical
methods
are more
People
inclined
them
to enjoy
without
Cosmic
rewarded
working
sufficient
Justice
with
(CJHs),
Hypotheses
in exact
or punished
by intelligent
pilgrimages,
the inevitable
thinkers.
or ask
proportion
Some
divine
payback,
hypotheses
and
less
inclined
to dismiss
as
"in
the fullness
them
or to accept
evidence.
CJHs
forgiveness:
since
the cosmos
such
to its goodness
that
imply
once
acts
works
it is pointless
are done,
inexorably
of time
or badness",
doers
toward
every act will be

have been entertained
to make
must
ready
justice.

sacrifices,
themselves
make
for
248
LOGIC
Some
of CJHs
variants
of time every person

or badness
of their acts".
Corcoran.
[2] Alfred
JOHN
variants
AND
to logic,
IDRIS
the Hereditary
Cumulative
will be rewarded
person
and
ethics.
Free
New
York,
Dover,
HAMID.
SAMAWI
to the net goodness
proportion
of their ancestors'
of logic
Introduction
CORCORAN
every
as "in the fullness
such
Hypotheses,
in exact
or badness
Inseparability
Tarski,
Justice
include
of time
the fullness
pp. 37-40.
Cosmic
or punished
to the net goodness
proportion
[1] John
Other
as "in
such
Hypotheses,
exact
are Cumulative
will be rewarded
13
COLLOQUIUM
Cosmic
Justice
or punished
in
acts".
vol.
Inquiry,
9 (1989),
no. 2,
1995.
distinctions
Objectivity-subjectivity
in logic.
Philosophy,
E-mail:
Colorado
Philosophy,
E-mail,
State
Church,
senses
said
implied
there
neither
Church
unrelated
USA.
use
logicians
of the words
cognates
subjectively,
We survey
and
objectivity,
where
epistemology
In primary
use and
conspicuous
other
historically
sense
[1] Alonzo
the exact
sub
thinking
nonuse
of
and
what
for each,
Neither
science.
58ff].
gives
Tarski
grounds
Aristotle,
Godel,
object
the word
while
frequently
Ockham,
al-Farabi,
and
Quine,
Lawvere.
with other
cognates
is called
zero
objective.
avoiding
occurs
objective
Carnap,
and
are correlative
conveyed
by calling
where
they would
for applying
Introduction
completely
[1. pp.
essentially
the subject
of the
two its object.
examples
of their criteria
Church.
syntax
subjective
is being
while
include
Russell,
of subject
the word
418fj.
there
considered
Frege,
arbitrary"
term.
holds:
Logicians
established
the overlying
pp. 412.
frequently
opposite
Peirce,
objective
give (1)
some
subjective
and
logic
essentially
[2, esp.
his crucial
uses
two and
and
for them
uses
epistemic
for example,
in logical
senses,
writers
basis
Morgan,
to determine
the underlying
are "subjective
absent.
zero precedes
each
like old and
adjectives
one as opposed
apply
young.
It
or subjective
objective
something
to the other
word.
to mathematical
Princeton
logic.
Press,
University
NJ, 1956.
Princeton,
[2] Alfred
Tarski.
Logic,
MATT
CORCORAN,
Philosophy,
E-mail,
80523-1781.
of geometryand
the above
uses:
is difficult
JOHN
[2]
De
al-Ahsa'i,
(2)
CO
subject-object
objects.
between
explains
[1]
is completely
sentence
factual
is no "objective"
We contrast
University
semantics,
metamathemutics.
LAVINE,
AND
at Buffalo.
Buffalo.
JUSTIN
NY
1983.
Hackett.
LEGAULT,
14260-4150.
Meanings
of hypothesis.
USA.
corcoranfflbuffalo.edu.
Newton's
Principia
quoted
Latin
readers
and
Mathematica
prompts
exists
on howfingo
to hypotheses.
applied
Greek
and
by both Latin
is cognate
hupothesis
A dictionary
[1, p. 1684].
sensefor
exhibits
used
other
("I
could
exists
English,
in Plato's
Academy
assumptions
uses
metaphorical
and
defined
in indirect
of make
be taken
with
("to
the
routinely
deductions
place-under"
same
used
and
frequently
modern
hypothesis.
in particular,
and,
what
making
noun
hypothesisborrowed
noun
The Greek
spelling.
place-under"):
hupothesis
His
hypotheses".
no hypotheses")puzzles
on the ambiguous
is to supposeoften
Aristotle
of "to
"making
make
interpretations
make")
Less
correlate
Contemporaneously,
reductio
of various
with the verb hupotithenai
A Latin-based
place").
("I
nonfingo"
consideration
mean
denied
famously
sentence"Hypotheses
A literature
("to
USA.
objectively,
in traditional
formalizations
distinctions
in Tarski
However,
unless
about
subjective,
distinguishing
such
Remarkably,
Boole.
to those
modern
for his claimand
subjective
Fort Collins.
mathematically-oriented
as objective,
judgments
example,
Church
from
14260-4150.
in logic.
words
For
other
related
disciplinesrequire
could
NY
edu.
subjectsuch
make
subjects
and
Tarski,
and
jectivityin
and
Buffalo.
University,
ishamidfflcolostate.
object
such
at Buffalo.
University
corcoranfflbuffalo.edu.
hupo-
("under");
to translate
as "indemonstrable
used hupothesis
first principle"
in a completely
[3, pp. xxx and 210],

and literal uses abound.

tithenai
hupotithenai.
Ancient
different
Greek
LOGIC
We
treat
senses
emphasizing
of hypothesisand
and,
hypothesis,
hypothesis
by that person
other
near
ments
has
Plato:
and
Aristotle's
AND
Prior
with
as
one
conjecture,
add
Hackett.
NY
postulate,
guess,
as in hypothetical
conditional,
consequent,
1997.
vol. 3 (1989).
pp.
17-43.
1989.
De
on Euclid's
Morgan
fourth postulate.
USA.
14260-4150,
to any point:
fourth
153-240]
the fifth: the parallel

[2. volume
postulate
translation
I. p. 200]
geometrical.
isas
gonius
are equal
it might
have
and
been
ullelais
to one
Euclid's
Ele
a line from
to draw
to Euclid,
einai.
another.
is:
(cf. [4. p. 121])
English
x, y. if x is right and
to angles
first:
is:
tas orthas
to us, as
notions"of
The
postulate.
in variable-enhanced
two angles
or "common
are specifically
of angles
y is right, then x equals

that
not for a property
the fourth
y.
uses
postulate
to anglesas
belonging
equal
for
intimated
by
to one another.
De
did
(1806-1871)
Morgan
he discovered
206-219]before
not
relational
see
it this
logic
latter he took
as elliptical
if emphasizing
Aristotelian
his construal
these
base-line
and
other
reference
1831
[1.
pp.
203,
he wrote:
equal
fourth
[1,
an
Aristotelian
subject
he applied
p. 203],
statements
the De
in [1].
Morgan's
Our
establishes
future progress
in
study
stunning
theory.
[1] Augustus
De
Morgan.
Study
and difficulties
of mathematics.
Open
Court.
Chicago.
1831/1943.
[2] Euclid.
[3] Daniel
Netherlands,
[4] Alfred
Elements,
Merrill.
3 volumes
Augustus
(Thomas
De
Morgan
Heath,
and
translator).
the logic
Dover,
of relations.
1990.
Tarski.
Introduction
to logic.
an
[1, p. 206]:
are right angles.
revealing
to measure
as
postulate
proposition
the following
magnitudes
historically
from which
magnitudes.
categorical
rule to it, deducing

Some
We examine
in
are equal.
are equal
of EuclidSs
universal-affirmative,
conversion
least
to one another,
for:
All right angles
copula-predicate,
at
way.
[3], Omitting
All right angles
The
false
or more
explanation,
adjective,
such
Hackett.
to "axioms"
opposed
I. pp.
It is clear
logical
to be
known
corcoranSbuffalo.edu.
first-order
zero
The
Argumentation,
NAMBIAR.
Buffalo,
a relation
As
others.
works.
Analytics.
SRIRAM
at Buffalo.
University
Given
The
contexts
synonyms
and logic.
All right angles
But.
proposition
known
true nor
condition,
Broader
near
Complete
Kai pasas
Euclid's
etc.
surmise,
Argumentations
five "postulates"as
any point
One
axiom,
assumption,
speculation,
editor.
Smith.
[2, volume
The
Goldbach
is defined
inferred, etc.
CORCORAN
The
hypothetical
hypothesis.
is interchangeable
hypothesis
theory,
proposition,
Corcoran.
[3] Robin
E-mail'.
if it is neither
time
where
antecedent,
prediction,
Cooper,
Philosophy.
continuum
question":
In [2],
hypothesis.
supposition,
imagined,
[1] John
[2] John
"open
at a given
passages
or hypothetical
imaginary,
JOHN
logic
synonyms:
inference,
situation
Fermat
person
presupposition,
hunch,
and
hypothesize
at that time.
discuss
of several
indicates
frequently
formerly.
a given
for
premise,
as
logic.
In logic hypothesis
We
such
cognates
249
13
COLLOQUIUM
Dover.
New
York,
1995.

New
Kluwer.
York,
1956.
Dordrecht.
250
LOGIC
JOHN
CORCORAN
self-sustaining
JOSE
MIGUEL
SAGUILLO,
Self-refuting
and
propositions
propositions.
Philosophy,
E-mail.
AND
13
COLLOQUIUM
at Buffalo.
University
NY
Buffalo,
14260-4150.
USA.
corcoranSbuffalo.edu.
Logic,
of Santiago
University
E-mail',
josemiguel.
Recent
By one
one
refuting;
Let
be an
again,
false proposition
its truth"
implies
and
propositions"
"whose
truth
is self-sustaining.
Perhaps
the proposition
fact that it is falsefrom

implies
its own
its own
negation.
But this means
and
But these
to distinguish
locutions
"a
truth does
not exist.
existent.
Thus
is self-refuting.
no
Similar
"a
proposition's
a self-contradictory
true (or tautological)

use the word
is one
is one
for a relation
fact
falsity"the
proposition
proposition
'implies'
from truths {or falsities)
truth"the
proposition's
to distinguish
Of course,
a logically
a relation
that no proposition
itself and
its negation.
negation,
to propositionsnot
both
is self-sustaining.
it is important
contexts
that it is truefrom
is self
unsurprisingly,
then P's falsity does not exist.

Thus,
existent.
Thus no true
by its truthsomething
is implied
falsity
that no proposition
In philosophical
"self-sustaining
its falsity"
implies
If P is true,
proposition.
P's
is self-refuting.
concludes
reasoning
"self-refuting
a proposition
empty.
arbitrary
that
Spain.
is self-refuting.
On the other hand,
if P is false, then P's
it is not the case that P's truth implies
its falsitysomething
proposition
Thus
seem
the case
discusses
definition,
falsity
classes
proposition
it is not
"whose
15782,
Santiago
es.
literature
philosophical
propositions".
de Compostela,
saguillofflusc.
that
implied
by
from propositions
to truths {or falsities)
of propositions
of propositions.
We continue
fulfilling
"Every
[1] and
and
self-denying
[1] John
YVON
believe
GAUTHIER,
H3C
6 (2000),
p. Ill,
we also
complement
statements
are made
using
and
self-defeating
A self-denying
statements.
self-affirming
treating
is a counterexample
this Bulletin,
vol.
proposition
15 (2009),
such
as
p. 244.
denies
statement
sentences
self
for itself, such

one
as 'Alfred
of
died,
it'.
Corcoran.
Meanings
of implication.
and
Kronecker'sfinitism
of Philosophy.
Department
And
Self-denying
implicatures.
but I don't
vol.
A self-defeating
is true".
proposition
treating
its own
this Bulletin,
propositions.
Godel's
of Montreal,
University
vol. 9 (1973),
Didlogos,
functional
C.P.
6128,
pp. 59-76.
interpretation.
Succ.
Centre-ville,
Montreal,
3J7. Canada.
E-mail',
As
ca.
yvon. gauthierfiumontreal.
noted by U. Kohlenbach
in his Applied
his Dialectica
makes
[2], where Godel
that Hilbert's
idea of higher-order
I want
1883
formulation
of higher-order
forms
a notion
of (polynomial)
in a domain
functions
of rational
divisors
for modular
how
this idea
use
subsequent
remarks
to argue
a rare reference
on Godel's
[1] Yvon
Foundational
[2] Kurt
is reflected
in Godel's
content
in Hilbert's
Dialectica
<extended>
Gauthier.
Godel.
functions
construction
interpretation.
Reports
in Contemporary
on Mathematical
Uher
of gaining
a general
algebraic
functions
Mathematics.
Uher eine hisher noch nicht benutze
Hilbert.
das
Unendliche.
General
vol. 48 (2013),
products
theory
(see
of
[1]).
Erweiterung
Mathematische
Applied
proof
Berlin/Heidelberg,
theory. Proof
Arithmetic
desfiniten
Annalen.
interpretations
as a
pp. 37-65.
pp. 161-190.
Kohlenhach.
[4] Ulrich
ematics.
Springer-Verlag,
Kronecker
and
of finite-type functionals
and their
I conclude
with some
philosophical
Logic,
Dialectica, vol. 12 (1958), pp. 230-237.

[3] David
and
sums
finitism.
Kronecker
Programme.
rational
with the aim
Here
[5].
with
in
In this
[3].
in Kronecker's
originates
for forms
their
of functionals
to Hilbert
polynomials
or inclusion
of rationality
of entire
systems
functionals
or homogeneous
and
Interpretations
for the introduction
by Hilbert
interpretation
talk,
I show
inspired
Proof
Theory.
[4], Godel
sketches
was
Proof
Use in Mathematics
Standpunktes.
vol.
95
(1926),
and their use in math
2008.

LOGIC
Zur
Kronecker.
[5] Leopold
der
Theorie
251
13
COLLOQUIUM
Formen
hdherer
Werke
Stufen.
(K.
Hensel.
of Sciences.
630090
editor). Teubner. Leipzig, vol. II (1968). pp. 419-424.
LARISA
MAKSIMOVA.
Sobolev
Branch
of Russian
Academy
lmaksi3math.nsc.ru.
Distinct
known
versions
normal
Beth
property
are presented
in [1].
S4 possess
the Craig
interpolation
we extend
this result
definability
modal
over
logics
IPD
property
interpolation
property IPR and the projective
or the deductive
CIP
the restricted
PB2
and
of interpolation
that only finitely many
property
logics
Siberian
Russia.
Novosibirsk,
E-mail:
and recognition.
Interpolation
of Mathematics.
Institute
interpolation
IPR
implies
but.
in general,
the converse
Here
[2],
Beth
PB2.
property
It is
to
In all modal
is not true.
IPR: If /l(p.q), fi(p.r) I~l C(p). then there is A'(p) such that /*(p.q) I~l A'(p) and
A'(p). fl(p.r) hL C(p).
PB2: If /l(p,q.x),/l(p.q',>')
hi. (x o y), then there is C(p) such that /l(p,q,x) t~z.
{x
C(p)).
A finitely axiomatizable
for any finite set Ax
Theorem
I.
There
L D S4 is recognizable
logic
schemes,
of axiom
bound
for the number
Theorem
2.
and IPR
is a duality
There
(or topoboolean)
SES
exist a D e
and
V()
is found.
V{L).
and monomorphisms
/?: A > B, y: A > C. there
S : B > D and e: C > D such that Sp = ey and Sp
V (L)
homomorphisms
is a monomorphism.
SES:
there
A, B 6
For any algebras

a D
exist
and
V{L)
over S4.
S4 and varieties of interior

logics extending
of IPR and PB2 in a logic L are RAP and
equivalents
A, B, C e
For any algebras
or PB2.
and recognizable
over S4.
of normal
the family
Algebraic
in the variety
respectively
RAP:
between
algebras.
with IPR
of logics
are decidable
IPR
of S4 possessing
axiomatizable.
which,
with L.
coincides
extensions
are finitely
property,
An upper
PB1
normal
are only finitely many
the finite model
All of them have
over S4 if there is an algorithm
if S4 -f Ax
recognizes
V(L).
two
/?: A > B and
any monomorphism
g, h:
homomorphisms
> D
B /?(A),
be
that gft =
such
hp
and
g(b) ^ h(b).
Theorem
3.
amalgamation
RAP
(2)
There are only finitely many
(1)
and SES
are base-decidable
[1] D. M. Gabhay
istic logics.
and
Oxford
Logic
RYSZARD
Institute
E-mail:
Algebra
M1REK.
Logic
1.13
side
of definite
form
after
of equations
one
della
can
launched
regular
and
how
della
Francesca's.
by the work
polyhedra
applying
and
be used
is known
to each
and intuition
and amalgamable
as
varieties
the first new
of
point.
is for instance
other,
a problem
octahedron
and
in the
triangles.
of Renaissance
painting
In his treatises
perspective.
geometry
a problem
of a regular
inscribed
inscribed
of similar
concept
square
is presented
proof
of Euclidean
There
symmetrically
The
theorem
European
of a horizontal
construction
to the interpretation
the arithmetization
of the regular
of an octahedron
logics
refers to the Euclidean
can
Modal
2005.
no. 5. pp. 556-586.
the strict rules of geometry
to complete
to find the side
for a problem
Oxford.
Poland.
perspective
of the definite
of Fibonacci.
in relation
of Krakow.
Francesca
diagrams,
find an example
in modal
18 (1979).
It concerns
from the elevation

and
Press.
Fruncesca.
University
time this proposition
At the same
Piero
of Piero
vol.
della
ofPiero
Fibonacci.
seen
theorems
and Logic,
algebras.
and definability:
Interpolation
Interpolation
algebras.
Proposition
with the restricted
of interior algebras
of interior
vol. 46. Clarendon
of Logic.
Pedagogical
mirek.
fm.
r<3poczta.
in geometry
in varieties
L. Maksimova.
Guides,
[2] L. L. Maksimova.
topoboolean
varieties
RA P.
property
that
deals
tetrahedron
in a regular
in a dodecahedron,

which
with
the
in a cube
tetrahedron.
della
was
As
Francesca
252
LOGIC
a new and
proves
result.
geometrical
purely
'13
COLLOQUIUM
a computation
He uses
which
was
probably
used
for the first time ever.

The
of the study
purpose
is to provide
are employed
in the treatises
are consistent
with the inferences
E of Mumma's[l].
system
circles,
lines,
standard
series
a detailed
of perspective
and
angles,
areas.
as follows
logic,
and
posed
problems
solved
J. Avigad.
NAYEBI,
E. Dean.
and
Exponential
111
University,
E-mail:
and
axiomatic
with sorts
it is possible
proofs
in certain
even
a formal
use
refers to a theory
from the simple
builds
A formal
of Symbolic Logic, vol. 2 (2009). no. 4. pp. 700-768.
Stanford
can
that
methods
for points,
to employ
of sequents.
The
to the complex
in a
way.
[1] J. Mumma.
ARAN
and
that such
Elements
is six sorted,
language
of inference
to prove
one
purpose
As theorems
for first-order
calculus
very methodical
the logical
Generally,
segments,
Gentzen
this
I intend
in Euclid's
that are employed

For
of the methods
analysis
Francesca.
della
of the development.
examples
aspects
of Piero
prefixed
Palo
elements.
The Review
equations.
polynomial
Avenue.
Moreno
system for Euclid's
CA
Alto,
USA.
94303,
emayebiQstanford.edu.
URL
Address:
prefixed
http://www.stamford.edu/~anayebi/.
is an equation
equation
P is a polynomial
whose
quantifiers
over
some,
tion
such
possible
of all
of being
variables
or all.
The
of its variables.
equivalent
arithmetical
by
the collec
the equivalence
relation
for "exponential
to some
equivalent
preceded
[1] study
is arithmetically
equations
is EFA-provably
with
stands
(EFA
numbers,
Smet
De
it the "Atlas",
its members
polynomial
formula
and
0, where
P(v\,...,vn)
the natural
Bovykin
terming
on
set of prefixed
over
v range
v\
expressions,
EFA-provably
arithmetic").
first-order
of the form
polynomial
function
completeevery
prefixed
polynomial
equation.
In this talk,
ables
can
also
we consider
occur
combinatorial
primitive
is independent
ods
prefixed
We obtain
of Peano
Some
arithmetic).
for the elimination
theorem
as well as an EPPE
arithmetic),
[1] A.
mial
Bovykin
and
with
equations
M.
Dn
Smet.
A
and
quantifier-prefixes
study
the
http://logic.pdmi.ras.ru/~andrey/baby/baby_project.pdf
Hilbert's
tenth problem.
[2] Yu. V. Matiyasevich.
Cambridge,
[3] A. Nayebi.
[2],
the
of
in addition
Complete
Atlas
all
of
of
is independent
theorem
(which
to known
meth
are
proofs
possible
given
polyno
classes.
of provable-equivalence
(draft).
Foundations
of Computing
Series,
MIT
1993.
Massachusetts,
Press,
are used
structure
(which
vari
to the
equivalent
to Goodstein's
quantifiers
in [3],
I~l5 EPPE
for pairs
equivalent
new devices
universal
of bounded
concise
where
(EPPEs),
equations
polynomial
a relatively
of the Paris-Harrington
principle
recursive
exponential
as exponents.
prefixed
Exponential
polynomial
arXiv
equations.
preprint,
arXiv:
1303.5777.
CYRUS
F. NOURANI.
Box
San
190762,
E-mail:
The
Fragment
AcdmkrdQgmail.com.
author had defined
the positive
CA
Francisco,
fragment
specific
obtained
with objects
category
positive
From author ASL
-Sofia:
Let us define
product
copies
Observations:
topology,
(ii)
author's
on projective
sets.
USA.
realizabilities
on positive
from the Keisler

fragments
and
fragment.
arrows
formulas
Define
since
(i)A
M
2005.
the category
the subfoumual
on the Keisler fragment

K, on Li . Let
topology
K the product
Let F = {K, K2
toplogy.
}.
of F from a topological
subset
of elements
space
Let Lp,(11 be
Lp0J to be the
preorder
a discrete
on K.
on formulas.
M be the infinite
Give
is homomorphic
fragmentprojection of A is {<
From
models
ultraproduct
94105.
Summer
colloquium
to its product
with
itself.
Definition
n. > A)}.
Sophia:

with
If A
a pointset
Mn+I
the
LOGIC
On
Theorem.
Fragment
M 1= iff Mi 1= a projection
the interim
consider
theorem,
consistency
on fragments
253
13
COLLOQUIUM
sets that positively
models
fragment
realize
locally
Mi.
is the set modeled
at
the ith tower iteration.

The
new areas:
ofL p,(. iff'Ai 1= a projection

every type is positively
Corollary
language
interim
2.
a k+
models
is a model
Ai.
if for every subset
X of cardinal
in.
3, are positively
theorem
Mi,
-saturated
at the interim
interim
* FLORIAN
lias a model
Some
PELUPESSY,
iff every finite fragment

model
k-saturated
group
extensions
elementary
have
projections.
on phase
observations
Ghent
of Mathematics,
Department
on fragments
that is the Ultraproduct
language.
filter to the fragment
product
has
extension
elementary
The language
(ii)
reduced
model
Each fragment
saturated
at the positive
University,
in logic.
transitions
B 9000,
281.
Krijgslaan
Gent.
Belgium.
be.
E-mail:
ugent.
pelupessyQcage.
in logic is the study
Phase transitions
values
a better
to the independence
according
what
understanding
the finite adjacent
orem,
Dickson's
The
lemma,
take place
well inside
THEODORE
transitions
di Ingegneria
Siena.
E-mail',
braid
the
the Kanamori-McAloon
theorem.
Maclagan's
groups.
theorem.
leads
always
combinatorial
to interesting
from II.
of independence
ANDREA
AND
The
of Mathematics.
Department
slamanSmath.
E-mail'.
berkeley.
53100
theorem,
battles,
Hydra
of the enumeration
segments
Dipartimento
unprovable
ip/. The goal is gaining

T. Many results have
questions
function
exponential
this phenomenon.
A. SLAMAN.
hility in initial
theorem
or. in the case
Hi
ordered
in a theory
Kruskal's
and
of phase
We examine
arithmetic.
theorem.
Ramsey
<pf where the parameter

domination,
by eventual
theorems
/.
of the resulting
theorems
for the Paris-Harrington
a-largenes.
determining
which
makes
for example
obtained,
of parameterized
functions
N > N. Nondecreasing
/ are functions
are classified
been
saturated
is positively
realized
locally
UAi
ultraprodcut
realize
locally
fragment.
Corollary
(i)
The
1.
sets that Horn
on fragments
Let us say that model
Definition.
ity <.
model
There is an ultrufiler If such that the fragment
Theorem.
SORBI.
Downwards
density
and
incompara
degrees.
University
of California.
CA
Berkeley,
USA.
94720-3840,
edu.
e Scienze
dell'Informazione
Matematiche.
di Siena.
Universita
Italy.
sorbi2unisi.it.
that there
It is known
is no minimal
enumeration
degree.
We improve
on this result
by
showing:
1. Below
Theorem
every nonzero
enumeration
degree
one can embed
every countable
partial
order.
The
interval
2.
// a.b
are
Faculty
Some
1, GSP-1.
Gory.
6. room
(where
RAS,
Lab
409.
Bolshoy
sort 0 is for natural
numbers,
<
b. then in the degree
properties
for intuitionistic
set theory
with
M.
Moscow
Moscow.
ru.
a. g. vladimirovQmail.
ZFI2C
be usual intuitionistic
and
order.
partial
conservativity
and
and principles
ECT,
and Mathematics,
of Mechanics
IITP
Let
every countable
partial
with a total,
degrees,
DCS
ing. Leninskiye
E-mail:
of the following:
enumeration
(a, b), one can embed
A. G. VLADIMIROV,
principle
case
is in fact a particular
result
Theorem
State
119991.
Karetny
per..
Zermelo-Fraenkel
and
sort
University,
room
1605,
Main
Build
Russia.
19. GSP-4.
Moscow,
set theory
127994.
in two-sorted
1 is for sets).

Russia.
language
254
LOGIC
Axioms
cate
and
set theory
Fraenkel
Power
Union,
Collection
all
are:
and
arithmetic,
of sort
for variables
set. Infinity, and
usual
axioms
all usual
schemes
and
axioms
1, namely,
rules
axioms
proper
schemes
Induction
predi
of Zermelo
of Extensionality.
Transfinite
Separation,
of intuitionistic
and
Infinity,
Pair,
as Regularity,
and
as Substitution.
It is well known
Double
that both
ZFI2C
of Sets)
Complement
numerical
(DP),
property
that the Markov

Such
of the system
rules
intuitionistic
logic,
'13
COLLOQUIUM
Rule,
collection
and
haves
ZFI2C
some
existence
+ DCS
of existence
properties
hand
+ DCS
and
not
is a well known
of effectivity:
properties
(but
property
Rule,
the Church
DCS
(where
important
full existence
the Uniformization
shows
that these
theories
the classical
theory
principle
disjunction
and
property!)
Rule
also
are admissible
are sufficiently
in it.
constructive
theories.
On the other
the sense
of Godel's
may be formalized
about
problems
arithmetical
Extended
over
we
Church
Thesis.
a usual
Weak
theory
T w.r.t. class
WEISS,
E-mail:
URL
Address:
on
Let
and
terms,
set over M
schema
+ ECT
T is ZFI2C
the Uniformization
denial;
Wittgenstein's
in Am
Principle
induction
is the joint
of this
complexity
in KPU+
Working
6 Z,
(A 1
jC
Ak)
and
and
the powerset
t for u in A. And
of EF,
let Am
and a wellfounded
notations,
the sentential
-< identifies
subsets
notations
of T
a set Obj
A =
for A, A\
Ak Z,
B oc Ai for some
B oc C\ for some
[A 1, p, A2] and
the result
a e
notation
of elements
x a variable,
Obj,
Now
The
Aj
and
some
\JBÂ\B\\fA t EP. and A = {w eT:

With
respect
to expressiveness
such
for p in C, for all i <
put B -< A iff there's a C Z

truth-condition
\A\ of A Z
of Z
such
arises
-< on Z.
Ao relation
,Ak)
and
p a prepo
B oc A means
informally
More
A is
of Z.
precisely,
B oc A iff
A,, or
C\ Z
there are C\Ck
of substituting
of
be an admissible
of which
as intensions
b e
Sub{x, a, C). or
language
4- Infinity
Infinity.
that B is among
along
The
sentences,
u, A) of substituting
+
sentence
nonelementary
Toward
an auxiliary
relation
oc on 2:
defining -< we introduce
that B is among
the sentential
notations
A.
specified
by notation
either A e EF or A = NC and B = A, or
A =
UP.
proposal.
a set Z of Tractatus
-< A means
every
of specifiability.
of elementary
Sub(t,
Â 6 Z. and [A\, p, A2]

sitional
variable.
A =
or
DCS
Define Z by induction so that (1) EF C Z\ (2) NA e Z ifA Z\ and (3) {A\
is
the
Canada.
V6T1Z1,
of sentences.
of the condition
KPU+
satisfying
relation
M~
over
here
is conservative
in which
is a
of the
is conservative
V 3bd{a\b),
ECT
Columbia.
in which
multiplicity
of a set EF
an operation
We construct
the joint
a language
"specifiable"
the strength
consist
to the theory
of British
University
[2] described
we reconstruct
(cf. [1]),
is the usual
of kind
the theory
?(;/>)
ww.whythis.net.
of some
depends
over
where
net.
maxfiwhythis.
denial
preserves
ECT
formulae
negative
if we add
and extraction
proof
is conservative
that ZFI2C
that T +
prove
in it a lot of informal
V 3btf(a;b).
Here
prove
reasons
in the Tractatus.
Logic
Wittgenstein
The
of all arithmetical
results
ECT
of kind
of all formulae
We also
Principle.
of Philosophy,
Department
we also
decide
in
+ LEM)
mathematical
of it's existence.
proof
+
formula.
w.r.t. class
and
ZFI2C
(i.e..
into intuitionistical
formulae
sense)
Of course,
M~
Markov
All these
MAX
(in the usual
ZFI2C
DCS
of all
formalize
reason
from some
object
ZFI2C
w.r.t. class
negative
so, we can
of a classical
ZF2
a lot of important
Moreover,
+ DCS,
that
prove
the theory
ZFI2C.
in ZFI2C
of a mathematical
DCS
contain
translation.
transformation
of a description
In this talk
ZFI2C
ZFI2C
negative
that A =
NC
Obj
such
that
that B oc Q,
Ci)
A\. and
C,-+1 is
k.
and
by induction
B oc C.
along
-< as follows:
A ?/;} otherwise.
we have
Ci
Sub(x,b,
the following.

\A\
LOGIC
Proposition
element
1. Every
intension
COLLOQUIUM
of a closed
'13
255
over T
first-order formula
is the intension
of an
of Z.
Proposition
2.
The transitive
closure
of a Z-definahle
Admissible
sets and structures.
[1] J. Barwise.
Logische-Philosophische
[2] L. Wittgenstein.
Springer.
relation
Berlin.
Ahhandlung.
is Z-definahle.
1975.
Annulender
vol. 14 (1921). pp. 198-262.

Nuturphilosophie.

Cogreee

Enviado por

Dados do documento

Título original

Direitos autorais

Formatos disponíveis

Compartilhar este documento

Compartilhar ou incorporar documento

Opções de compartilhamento

Você considera este documento útil?

Este conteúdo é inapropriado?

Direitos autorais:

Formatos disponíveis

Cogreee

Enviado por

Direitos autorais:

Formatos disponíveis

2013 EUROPEAN SUMMER MEETING OF THE ASSOCIATION FOR SYMBOLIC LOGIC LOGIC

COLLOQUIUM '13: Evora, Portugal July 2227, 2013

This content downloaded from 194.27.186.191 on Thu, 9 Oct 2014 14:23:13 PM

Volume 20. Number 2. June 2014

Luis Pinto (Univ. Minho and

Velickovic (Paris, Chair).

Manuel Martins (Univ. Aveiro and CIDMA),

for the conference

2014. Association for Symbolic Logic

This content downloaded from 194.27.186.191 on Thu, 9 Oct 2014 14:23:13 PM

theory over the reals:

the size of the continuum.

in sets with atoms.

For the Program

We give in this tutorial

This content downloaded from 194.27.186.191 on Thu, 9 Oct 2014 14:23:13 PM

LEMPP. AND THEODORE

is the fruitful interplay

of the two models

that there is a strong

play, but games

see the book

in sets with atoms.

for the computer

where they are called

This content downloaded from 194.27.186.191 on Thu, 9 Oct 2014 14:23:13 PM

by sets with atoms,

the set of rational

for sets with atoms,

true in the iterated

that there are neither

of the real line.

the two notions

theory and the size of the continuum.

there are fewer equivalences

in finite time, and

This content downloaded from 194.27.186.191 on Thu, 9 Oct 2014 14:23:13 PM

way on the pro-definable

that the continuum

The oldest and perhaps

that are not explicitly

I will give an overview

the set of theorems

led to the solution

This content downloaded from 194.27.186.191 on Thu, 9 Oct 2014 14:23:13 PM

theory, set theory

theory, on p and t. announcement

over the reals:

over the natural

sets [1], we arrive

of the real field by the restricted

that is. *-algebras

in the field of operator

they are built out of, has

that act on separable

This content downloaded from 194.27.186.191 on Thu, 9 Oct 2014 14:23:13 PM

In the last decade,

no. 8, pp. 2710-2724.

of the new approach

is very high indeed.

(2010). no. 9. pp. 2238-2252.

vol. 15 (2009). no. 2. pp. 169-183.

As this talk will show,