Post has shared content
An easy one. Have fun!!
Challenge your brain with this logical riddle. There are 3 bags on a table. One of the bag contains cash and the other two are empty. The bags are labelled with printed messages. The messages on the respective bags are; The first bag says: “The Cash is…

Post has shared content

Post has shared content

Post has attachment

Post has attachment
The Hardest Logic Puzzle Ever
Three gods A, B, and C are called, in no particular order, True, False, and Random. True always speaks truly, False always speaks falsely, but whether Random speaks truly or falsely is a completely random matter. Your task is to determine the identities of A, B, and C by asking three yes-no questions; each question must be put to exactly one god. The gods understand English, but will answer all questions in their own language, in which the words for yes and no are da and ja, in some order. You do not know which word means which.
#puzzle   #logic  
Original article here:

logic is every where!

Post has attachment

Post has attachment

Post has attachment
The Silver Age of Austrian Logic

"Once again, Vienna is one of the capitals of logic research, more than 80 years after Kurt Gödel wrote down his incompleteness theorems. The Vienna Circle started the golden age of logic. Now, a new “silver age” has begun."

  APPA - ∀X.Xπ - All about Proofs, Proofs for All
          ++ Tutorials about Proofs ++
         July 18, 2014, Vienna, Austria

           --- call for participation -

Register now at, selecting "APPA" on workshop block 2. 
Early-registered participants will receive a book with the invited papers. 
Early registration goes until 8th of June.


Many of us, logicians, devote our work to the improvement of proofs, proof systems, proof formats, interactive proof script languages, proof search methods... But what makes a proof (system|format|search-method|...) better than another? Logicians from different communities will give radically different answers to this question! The principles behind their answers may be unknown to outsiders; they may even sound obscure, ungrounded or in apparent contradiction to the principles of other communities.

The Vienna Summer of Logic presents a unique opportunity to promote a conversation between all communities on questions related to proofs. ∀X.XΠ will promote a fruitful knowledge exchange by organizing short tutorials given by prominent speakers from various communities. These tutorials shall be accessible to young researchers and of interest to experienced researchers from other communities as well. 

Tutorial Topics and Speakers

- SAT-Solvers: 
+ Marijn Heule (University of Texas at Austin, USA)

- SMT-Solvers:  
+ Clark Barrett (New York University, USA)
+ Pascal Fontaine (LORIA Nancy, France)
+ Leonardo de Moura (Microsoft Research, USA)

- First-order Automated Theorem Provers: 
+ Stephan Schulz (Munich University of Technology, Germany)

- Higher-order Automated Theorem Provers: 
+ Christoph Benzmüller (Freie Universität Berlin, Germany)

- Interactive Theorem Provers: 
+ Makarius Wenzel (LRI, Université Paris Sud, France)

- Calculus of Inductive Constructions: 
+ Christine Paulin-Mohring (LRI & INRIA Saclay, France)

- Deduction Modulo: 
+ Gilles Dowek (INRIA Paris, France)

- Deep Inference: 
+ Alessio Guglielmi (University of Bath, England)

- Foundational Proof Certificates: 
+ Dale Miller (École Polytechnique, Paris, France)

- Program Verification (B Method): 
+ Jean-Raymond Abrial (ETH Zürich, Switzerland)

- Security:
+ Gilles Barthe (IMDEA Software Institute, Madrid, Spain)

- Mathematical Proof Analysis:
+ Alexander Leitsch (Vienna University of Technology, Austria)


- David Delahaye (Cedric/Cnam/Inria, Paris)
- Bruno Woltzenlogel Paleo (Vienna University of Technology)

For more information, visit:
Wait while more posts are being loaded