IEEE Conference on Computational Complexity

The 26th Conference
June 8th to June 10th, 2011
Federated Computing Research Conference
San Jose, California

Announcements

The 2010 conference recently concluded.  The number of registered participants was one of the largest for the conference.  Many thanks to local organizers Salil Vadhan, Scott Aaronson, Steve Homer, Madhu Sudan, and Emanuele Viola.
Next year's conference will be part of the 2011 Federated Computing Research Conference, a collection of 15 overlapping conferences and workshops.  FCRC will take place in San Jose, California, and will run from Saturday, June 4th, to Saturday, the 11th.  Complexity will run from Wednesday, June 8th, to Friday, the 10th.  Local arrangements information, when available, will be found on the FCRC site.
The 2012 conference returns to Europe and will be held in Porto, Portugal.  Details will appear when they are determined.  

Toremas e metateoremas básicos da lógica

Lógica Proposicional

Metateorema da dedução

Consistência

Corretude

Completude

Compacidade

Graig's interpolation lemma for propositional calculus

Lógica de primeira ordem

Consistência

Corretude

Completude

Indecidibilidade

Compacidade

Abdução

.

Por Samir Gorsky

INTROCUÇÃO

Abdução pode ser definido como um tipo de raciocínio ou inferência pela melhor explicação. Neste caso, busca-se a hipótese que melhor se encaixa na argumentação e não uma conclusão do raciocínio que seja válida. Charles S. Peirce é a principal referência para a definição original deste conceito. Sua meta principal foi estabelecer uma semiótica para o pensamento e a linguagem (cf. [PEI] e [ALI]) e a questão central de sua pesquisa filosófica foi: como estabelecer uma estrutura lógica que pudesse explicar a possibilidade de raciocínios sintéticos a priori? Bastante influenciado pela filosofia kantiana, Peirce retendeu extender suas categorias e assim adequar e generalizar a lógica.

"According to Kant, the central question of philosophy is `How are synthetical judgements a priori possible?' But antecedently to this comes the question how synthetical judgements in general, and still more generally, how synthetical reasoning is possible at all. When the answer to the general problem has been obtained, the particular one will be comparatively simple. This is the lock upon the door of philosophy." (CP, 5.348, quoted in Hookway (1992), page 18).



Referências

[ALI] ALISEDA, Atocha. Abduction as epistemic change: Charles S.Peirce and epistemic theories in artificial intelligence (em http://user.uni-frankfurt.de/~wirth/texte/tt.htm)

[PEI] PEIRCE, C.S.(1931-1958) Collected Papers (CP), vols 1-8, C. Hartshorne, P. Weiss and A.W. Burks (eds). Cambridge, MA: Harvard University Press.

Site Pessoal

Um jogo de cartas para lógica booleana.

--------------


fun AND cards NOT boring

Here's a riddle for you: What sort of logic do ghosts like? Answer:
"Boo"-lean Logic. We're here all week. But seriously folks, Boolean logic is
so much fun - it's about time someone applied that fun to a card game. So
they have, with *bOOleO Boolean Logic Card Game*! It's fun AND logical AND
challenging (get it, we used Boolean logic there - oh yeah)! Read on for a
sample of how difficult AND exciting *bOOleO Boolean Logic Card Game* is.

*bOOleO Boolean Logic Card Game* is basically a simple card game. You are
your opponent start off with a home row of binary numbers. With a "draw a
card/play a card" game play, you feverishly try to race your opponent to
complete your logic pyramid. Using AND, OR, XOR, & NOT cards, you begin
reducing your home row down into one card. First one to cap the pyramid (so
to speak) wins. Sounds easy, until you realize the NOT card is played on a
card in the home row, which could devastate your opponent's pyramid (AND
possibly also your own). Yup, *bOOleO Boolean Logic Card Game* has a Logical
atom bomb. It's *that* awesome.

*bOOleO Boolean Logic Card Game*

- A fast-paced card game that stimulates the logical part of your brain,
as you work with Boolean logic to beat your opponent.
- The Standard Edition with AND, OR, XOR, and NOT cards.
- *Includes:* 64 cards, instructions, plastic case
- *Card Dimensions:* 2.5" x 3.5"

Site Pessoal

Trabalhos em filosofia e lógica

.


GORSKY, Samir. A Semântica algébrica para as lógicas modais e seu interesse filosófico. Dissertação de mestrado. UNICAMP, 2008


GORSKY, Samir. Semântica Algébrica Para as Lógicas Modais. (Slides da apresentação no Symposium Internacional Principia - (09/08/2007) Florianópolis - SC)


GORSKY, Samir. Lógicas da Inconsistência Formal - Introdução (Slides da apresentação na disciplina Lógicas Não-clássicas (10/04/2007) UNICAMP - Campinas - SP)


GORSKY, Samir. Alguns sistemas multimodais alético-temporais (Slides da apresentação na ANPOF (26/10/2006) Salvador - BA)


GORSKY, Samir. Lukasiewicz, bivalência e verofuncionalidade (Slides apresentados no seminário CLE-UNICAMP 29/08/2006)


GORSKY, Samir. Lukasiewicz, bivalência e verofuncionalidade (Texto apresentado em seminário no CLE-UNICAMP 29/08/2006)


GORSKY, Samir. Completude e Incompletude dos Sistemas Modais Normais (Texto apresentado em seminário no CLE-UNICAMP 24/05/2006)


GORSKY, Samir. Sistemas Aristotélicos e Diodoréios (Artigo Aceito para o XIV encontro Nacional de Lógica(XIV EBL))


GORSKY, Samir. O Teorema De Lindström (Texto que eu apresentei em seminário na UNICAMP)


GORSKY, Samir. Alguns sistemas modais fracos. Monografia. Unb 2003.


GORSKY, Samir. Escritos Filosóficos (Coletânea de trabalhos acadêmicos 1999-2006)


Blog Home

Site

Enzyme computers could live inside us, dispense drugs

By Evan Blass

Israeli researchers have just announced the successful completion of a molecular computer, which uses enzymatic chemical reactions to perform the necessary logic computations. Itamar Willner and his team at the Hebrew University of Jerusalem built the computer using glucose dehydrogenase (GDH) and horseradish peroxidase (HRP) enzymes, with hydrogen peroxide and glucose molecules representing input values. The presence or absence of these two chemicals correspond to binary 1s and 0s, allowing the computer to perform AND and XOR operations which are determined optically by a camera. Although enzyme computers will always be inherently slower than parallel processing DNA computers, Willner envisions his invention being used one day to precisely calculate and distribute doses of medicine from inside a patient's body.

Artigo interessante

http://www.filozof.uni.lodz.pl/bulletin/pdf/12_4_6.pdf

Puzzle's Theory

The theory of the puzzles (or Puzzle's theory) is the research on the fundamental structures responsible for the emergence and dissolution of the problems and riddles in general. This area of knowledge is being originally developed by me Samir Gorsky since January 2008.

The puzzle's theory involves the following subjects:

Philosophy, Logic, Math, Game Theory, Psychology, Computability

Site Pessoal

Reflexões e formalizações acerca do paradoxo do exame surpresa

Quarta-feira, 10 de junho de 2009, 17h
Local: Auditório do CLE-UNICAMP

Resumo: Michel Scriven publicou em 1951 no periódico britânico de filosofia Mind um artigo em que descrevia uma determinada situação considerada paradoxal. Este paradoxo ficou conhecido como Paradoxo do Exame Surpresa. O artigo possui a seguinte sentença inicial: "A NEW AND POWERFUL PARADOX has Come to light". Desde sua publicação o artigo rendeu muitas pesquisas e comentários de importantes filósofos. As tentativas de solucionar este enigma (puzzle) são bastante divergentes umas das outras. Isso mostra que o problema relatado é mais complexo do que parece, portanto uma maior atenção deve ser dada a ele tal como O'Connor escreveu em seu artigo "It is worthwhile for philosophers to pay a little more attention to these puzzles than they have done up to now even if their scrutiny does no more than make a little clearer the ways in which ordinary language can limit and mislead us" (O'CONNOR. Pragmatic Paradoxes). O presente seminário tem como objetivo apresentar, discutir e revisar versões, comentários e análises sobre o paradoxo do enforcado ou, como é mais conhecido, o paradoxo do exame surpresa.



Referências:





Chapman JM, Butler RJ. One Quine's so-called paradox. Mind 74 1965 pp. 424-425



Fitch F. A Gödelized formulation of the prediction paradox. American Philosophical Quarterly 1 1964 pp. 161-16



Gardner M. A new prediction paradox. British Journal for the Philosophy of Science 13 1962 p. 51



Gardner, M. The Unexpected Hanging and Other Mathematical Diversions, University Of Chicago Press; Reprint edition; 1991.



O'Connor DJ. Pragmatic Paradoxes. Mind 57 1948 pp. 358-359



O'Connor DJ. Pragmatic paradoxes and fugitive propositions. Mind 60 1951 pp. 536-538



Shaw R. The paradox of the unexpected examination. Mind 67 1958 pp. 382-384

Site Pessoal