TPTP Problem File: SYN406+1.p
View Solutions
- Solve Problem
%--------------------------------------------------------------------------
% File : SYN406+1 : TPTP v9.0.0. Released v2.0.0.
% Domain : Syntactic
% Problem : Kalish and Montague Problem 240
% Version : Especial.
% English : Laws of alphabetic variance.
% Refs : [KM64] Kalish & Montegue (1964), Logic: Techniques of Formal
% : [Hah94] Haehnle (1994), Email to G. Sutcliffe
% Source : [Hah94]
% Names : kalish240 [Hah94]
% Status : Theorem
% Rating : 0.00 v5.3.0, 0.09 v5.2.0, 0.00 v2.1.0
% Syntax : Number of formulae : 1 ( 0 unt; 0 def)
% Number of atoms : 6 ( 0 equ)
% Maximal formula atoms : 6 ( 6 avg)
% Number of connectives : 5 ( 0 ~; 0 |; 3 &)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 5 ( 5 avg)
% Maximal term depth : 1 ( 1 avg)
% Number of predicates : 3 ( 3 usr; 0 prp; 1-1 aty)
% Number of functors : 0 ( 0 usr; 0 con; --- aty)
% Number of variables : 3 ( 1 !; 2 ?)
% SPC : FOF_THM_EPR_NEQ
% Comments :
%--------------------------------------------------------------------------
fof(kalish240,conjecture,
( ( ! [X] :
( f(X)
=> g(X) )
& ? [Y] :
( f(Y)
& h(Y) ) )
=> ? [Z] :
( g(Z)
& h(Z) ) ) ).
%--------------------------------------------------------------------------