\documentclass[11pt,twoside]{article}\makeatletter

\IfFileExists{xcolor.sty}%
  {\RequirePackage{xcolor}}%
  {\RequirePackage{color}}
\usepackage{colortbl}
\usepackage{wrapfig}
\usepackage{ifxetex}
\ifxetex
  \usepackage{fontspec}
  \usepackage{xunicode}
  \catcode`⃥=\active \def⃥{\textbackslash}
  \catcode`❴=\active \def❴{\{}
  \catcode`❵=\active \def❵{\}}
  \def\textJapanese{\fontspec{Noto Sans CJK JP}}
  \def\textChinese{\fontspec{Noto Sans CJK SC}}
  \def\textKorean{\fontspec{Noto Sans CJK KR}}
  \setmonofont{DejaVu Sans Mono}
  
\else
  \IfFileExists{utf8x.def}%
   {\usepackage[utf8x]{inputenc}
      \PrerenderUnicode{–}
    }%
   {\usepackage[utf8]{inputenc}}
  \usepackage[english]{babel}
  \usepackage[T1]{fontenc}
  \usepackage{float}
  \usepackage[]{ucs}
  \uc@dclc{8421}{default}{\textbackslash }
  \uc@dclc{10100}{default}{\{}
  \uc@dclc{10101}{default}{\}}
  \uc@dclc{8491}{default}{\AA{}}
  \uc@dclc{8239}{default}{\,}
  \uc@dclc{20154}{default}{ }
  \uc@dclc{10148}{default}{>}
  \def\textschwa{\rotatebox{-90}{e}}
  \def\textJapanese{}
  \def\textChinese{}
  \IfFileExists{tipa.sty}{\usepackage{tipa}}{}
\fi
\def\exampleFont{\ttfamily\small}
\DeclareTextSymbol{\textpi}{OML}{25}
\usepackage{relsize}
\RequirePackage{array}
\def\@testpach{\@chclass
 \ifnum \@lastchclass=6 \@ne \@chnum \@ne \else
  \ifnum \@lastchclass=7 5 \else
   \ifnum \@lastchclass=8 \tw@ \else
    \ifnum \@lastchclass=9 \thr@@
   \else \z@
   \ifnum \@lastchclass = 10 \else
   \edef\@nextchar{\expandafter\string\@nextchar}%
   \@chnum
   \if \@nextchar c\z@ \else
    \if \@nextchar l\@ne \else
     \if \@nextchar r\tw@ \else
   \z@ \@chclass
   \if\@nextchar |\@ne \else
    \if \@nextchar !6 \else
     \if \@nextchar @7 \else
      \if \@nextchar (8 \else
       \if \@nextchar )9 \else
  10
  \@chnum
  \if \@nextchar m\thr@@\else
   \if \@nextchar p4 \else
    \if \@nextchar b5 \else
   \z@ \@chclass \z@ \@preamerr \z@ \fi \fi \fi \fi
   \fi \fi  \fi  \fi  \fi  \fi  \fi \fi \fi \fi \fi \fi}
\gdef\arraybackslash{\let\\=\@arraycr}
\def\@textsubscript#1{{\m@th\ensuremath{_{\mbox{\fontsize\sf@size\z@#1}}}}}
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\def\abbr{}
\def\corr{}
\def\expan{}
\def\gap{}
\def\orig{}
\def\reg{}
\def\ref{}
\def\sic{}
\def\persName{}\def\name{}
\def\placeName{}
\def\orgName{}
\def\textcal#1{{\fontspec{Lucida Calligraphy}#1}}
\def\textgothic#1{{\fontspec{Lucida Blackletter}#1}}
\def\textlarge#1{{\large #1}}
\def\textoverbar#1{\ensuremath{\overline{#1}}}
\def\textquoted#1{‘#1’}
\def\textsmall#1{{\small #1}}
\def\textsubscript#1{\@textsubscript{\selectfont#1}}
\def\textxi{\ensuremath{\xi}}
\def\titlem{\itshape}
\newenvironment{biblfree}{}{\ifvmode\par\fi }
\newenvironment{bibl}{}{}
\newenvironment{byline}{\vskip6pt\itshape\fontsize{16pt}{18pt}\selectfont}{\par }
\newenvironment{citbibl}{}{\ifvmode\par\fi }
\newenvironment{docAuthor}{\ifvmode\vskip4pt\fontsize{16pt}{18pt}\selectfont\fi\itshape}{\ifvmode\par\fi }
\newenvironment{docDate}{}{\ifvmode\par\fi }
\newenvironment{docImprint}{\vskip 6pt}{\ifvmode\par\fi }
\newenvironment{docTitle}{\vskip6pt\bfseries\fontsize{22pt}{25pt}\selectfont}{\par }
\newenvironment{msHead}{\vskip 6pt}{\par}
\newenvironment{msItem}{\vskip 6pt}{\par}
\newenvironment{rubric}{}{}
\newenvironment{titlePart}{}{\par }

\newcolumntype{L}[1]{){\raggedright\arraybackslash}p{#1}}
\newcolumntype{C}[1]{){\centering\arraybackslash}p{#1}}
\newcolumntype{R}[1]{){\raggedleft\arraybackslash}p{#1}}
\newcolumntype{P}[1]{){\arraybackslash}p{#1}}
\newcolumntype{B}[1]{){\arraybackslash}b{#1}}
\newcolumntype{M}[1]{){\arraybackslash}m{#1}}
\definecolor{label}{gray}{0.75}
\def\unusedattribute#1{\sout{\textcolor{label}{#1}}}
\DeclareRobustCommand*{\xref}{\hyper@normalise\xref@}
\def\xref@#1#2{\hyper@linkurl{#2}{#1}}
\begingroup
\catcode`\_=\active
\gdef_#1{\ensuremath{\sb{\mathrm{#1}}}}
\endgroup
\mathcode`\_=\string"8000
\catcode`\_=12\relax

\usepackage[a4paper,twoside,lmargin=1in,rmargin=1in,tmargin=1in,bmargin=1in,marginparwidth=0.75in]{geometry}
\usepackage{framed}

\definecolor{shadecolor}{gray}{0.95}
\usepackage{longtable}
\usepackage[normalem]{ulem}
\usepackage{fancyvrb}
\usepackage{fancyhdr}
\usepackage{graphicx}
\usepackage{marginnote}

\renewcommand{\@cite}[1]{#1}


\renewcommand*{\marginfont}{\itshape\footnotesize}

\def\Gin@extensions{.pdf,.png,.jpg,.mps,.tif}

  \pagestyle{fancy}

\usepackage[pdftitle={Boosting Human Insight by Cooperative AI: Foundations of Shannon-Neumann Logic},
 pdfauthor={}]{hyperref}
\hyperbaseurl{}

	 \paperwidth210mm
	 \paperheight297mm
              
\def\@pnumwidth{1.55em}
\def\@tocrmarg {2.55em}
\def\@dotsep{4.5}
\setcounter{tocdepth}{3}
\clubpenalty=8000
\emergencystretch 3em
\hbadness=4000
\hyphenpenalty=400
\pretolerance=750
\tolerance=2000
\vbadness=4000
\widowpenalty=10000

\renewcommand\section{\@startsection {section}{1}{\z@}%
     {-1.75ex \@plus -0.5ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large\bfseries}}
\renewcommand\subsection{\@startsection{subsection}{2}{\z@}%
     {-1.75ex\@plus -0.5ex \@minus- .2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\Large}}
\renewcommand\subsubsection{\@startsection{subsubsection}{3}{\z@}%
     {-1.5ex\@plus -0.35ex \@minus -.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\large}}
\renewcommand\paragraph{\@startsection{paragraph}{4}{\z@}%
     {-1ex \@plus-0.35ex \@minus -0.2ex}%
     {0.5ex \@plus .2ex}%
     {\reset@font\normalsize}}
\renewcommand\subparagraph{\@startsection{subparagraph}{5}{\parindent}%
     {1.5ex \@plus1ex \@minus .2ex}%
     {-1em}%
     {\reset@font\normalsize\bfseries}}


\def\l@section#1#2{\addpenalty{\@secpenalty} \addvspace{1.0em plus 1pt}
 \@tempdima 1.5em \begingroup
 \parindent \z@ \rightskip \@pnumwidth 
 \parfillskip -\@pnumwidth 
 \bfseries \leavevmode #1\hfil \hbox to\@pnumwidth{\hss #2}\par
 \endgroup}
\def\l@subsection{\@dottedtocline{2}{1.5em}{2.3em}}
\def\l@subsubsection{\@dottedtocline{3}{3.8em}{3.2em}}
\def\l@paragraph{\@dottedtocline{4}{7.0em}{4.1em}}
\def\l@subparagraph{\@dottedtocline{5}{10em}{5em}}
\@ifundefined{c@section}{\newcounter{section}}{}
\@ifundefined{c@chapter}{\newcounter{chapter}}{}
\newif\if@mainmatter 
\@mainmattertrue
\def\chaptername{Chapter}
\def\frontmatter{%
  \pagenumbering{roman}
  \def\thechapter{\@roman\c@chapter}
  \def\theHchapter{\roman{chapter}}
  \def\thesection{\@roman\c@section}
  \def\theHsection{\roman{section}}
  \def\@chapapp{}%
}
\def\mainmatter{%
  \cleardoublepage
  \def\thechapter{\@arabic\c@chapter}
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \pagenumbering{arabic}
  \setcounter{secnumdepth}{6}
  \def\@chapapp{\chaptername}%
  \def\theHchapter{\arabic{chapter}}
  \def\thesection{\@arabic\c@section}
  \def\theHsection{\arabic{section}}
}
\def\backmatter{%
  \cleardoublepage
  \setcounter{chapter}{0}
  \setcounter{section}{0}
  \setcounter{secnumdepth}{2}
  \def\@chapapp{\appendixname}%
  \def\thechapter{\@Alph\c@chapter}
  \def\theHchapter{\Alph{chapter}}
  \appendix
}
\newenvironment{bibitemlist}[1]{%
   \list{\@biblabel{\@arabic\c@enumiv}}%
       {\settowidth\labelwidth{\@biblabel{#1}}%
        \leftmargin\labelwidth
        \advance\leftmargin\labelsep
        \@openbib@code
        \usecounter{enumiv}%
        \let\p@enumiv\@empty
        \renewcommand\theenumiv{\@arabic\c@enumiv}%
	}%
  \sloppy
  \clubpenalty4000
  \@clubpenalty \clubpenalty
  \widowpenalty4000%
  \sfcode`\.\@m}%
  {\def\@noitemerr
    {\@latex@warning{Empty `bibitemlist' environment}}%
    \endlist}

\def\tableofcontents{\section*{\contentsname}\@starttoc{toc}}
\parskip0pt
\parindent1em
\def\Panel#1#2#3#4{\multicolumn{#3}{){\columncolor{#2}}#4}{#1}}
\newenvironment{reflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemsep}{0pt}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\itshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{sansreflist}{%
  \begin{raggedright}\begin{list}{}
  {%
   \setlength{\topsep}{0pt}%
   \setlength{\rightmargin}{0.25in}%
   \setlength{\itemindent}{0pt}%
   \setlength{\parskip}{0pt}%
   \setlength{\itemsep}{0pt}%
   \setlength{\parsep}{2pt}%
   \def\makelabel##1{\upshape ##1}}%
  }
  {\end{list}\end{raggedright}}
\newenvironment{specHead}[2]%
 {\vspace{20pt}\hrule\vspace{10pt}%
  \phantomsection\label{#1}\markright{#2}%

  \pdfbookmark[2]{#2}{#1}%
  \hspace{-0.75in}{\bfseries\fontsize{16pt}{18pt}\selectfont#2}%
  }{}
      \def\TheFullDate{2022 1970-01-01 (revised: Year 2022 01 January 1970)}
\def\TheID{\makeatother }
\def\TheDate{2022 1970-01-01}
\title{Boosting Human Insight by Cooperative AI: Foundations of Shannon-Neumann Logic}
\author{}\makeatletter 
\makeatletter
\newcommand*{\cleartoleftpage}{%
  \clearpage
    \if@twoside
    \ifodd\c@page
      \hbox{}\newpage
      \if@twocolumn
        \hbox{}\newpage
      \fi
    \fi
  \fi
}
\makeatother
\makeatletter
\thispagestyle{empty}
\markright{\@title}\markboth{\@title}{\@author}
\renewcommand\small{\@setfontsize\small{9pt}{11pt}\abovedisplayskip 8.5\p@ plus3\p@ minus4\p@
\belowdisplayskip \abovedisplayskip
\abovedisplayshortskip \z@ plus2\p@
\belowdisplayshortskip 4\p@ plus2\p@ minus2\p@
\def\@listi{\leftmargin\leftmargini
               \topsep 2\p@ plus1\p@ minus1\p@
               \parsep 2\p@ plus\p@ minus\p@
               \itemsep 1pt}
}
\makeatother
\fvset{frame=single,numberblanklines=false,xleftmargin=5mm,xrightmargin=5mm}
\fancyhf{} 
\setlength{\headheight}{14pt}
\fancyhead[LE]{\bfseries\leftmark} 
\fancyhead[RO]{\bfseries\rightmark} 
\fancyfoot[RO]{}
\fancyfoot[CO]{\thepage}
\fancyfoot[LO]{\TheID}
\fancyfoot[LE]{}
\fancyfoot[CE]{\thepage}
\fancyfoot[RE]{\TheID}
\hypersetup{citebordercolor=0.75 0.75 0.75,linkbordercolor=0.75 0.75 0.75,urlbordercolor=0.75 0.75 0.75,bookmarksnumbered=true}
\fancypagestyle{plain}{\fancyhead{}\renewcommand{\headrulewidth}{0pt}}

\date{}
\usepackage{authblk}

\providecommand{\keywords}[1]
{
\footnotesize
  \textbf{\textit{Index terms---}} #1
}

\usepackage{graphicx,xcolor}
\definecolor{GJBlue}{HTML}{273B81}
\definecolor{GJLightBlue}{HTML}{0A9DD9}
\definecolor{GJMediumGrey}{HTML}{6D6E70}
\definecolor{GJLightGrey}{HTML}{929497} 

\renewenvironment{abstract}{%
   \setlength{\parindent}{0pt}\raggedright
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
   \textcolor{GJBlue}{\large\bfseries\abstractname\space}
}{%   
   \vskip8pt
   \textcolor{GJMediumGrey}{\rule{\textwidth}{2pt}}
   \vskip16pt
}

\usepackage[absolute,overlay]{textpos}

\makeatother 
      \usepackage{lineno}
      \linenumbers
      
\begin{document}

             \author[1]{Edouard  Siregar}

\renewcommand\Authands{ and }

\date{\small \em Received: 1 January 1970 Accepted: 1 January 1970 Published: 1 January 1970}

\maketitle


\begin{abstract}
        


We present the logical foundation of an artificial intelligence (AI) capable of dealing with complex dynamic challenges, that would be very hard to handled using traditional approaches (e.g. predicate logic and deep learning). The AI is based on a cooperative questioning game, to boost insight. Insight gains are measured by information, probability, uncertainty (Shannon), as well as utility (von Neumann).The framework is a two-person cooperative iterated Q&A game, in which both players (human, AI agent) benefit (positive-sum): the human player gains insight and the AI player learns to improve its suggestions. Generally speaking, valuable insight is typically gained by asking 'good' questions about the 'right' topic, at the 'appropriate' time and place: by posing insightful questions. In this study, we propose a logical and mathematical framework, for the meanings of 'good, right, appropriate', within clearly-defined classes of human intentions.

\end{abstract}


\keywords{artificial general intelligence, complexity, cooperative learning games, frame drift problem.}

\begin{textblock*}{18cm}(1cm,1cm) % {block width} (coords) 
\textcolor{GJBlue}{\LARGE Global Journals \LaTeX\ JournalKaleidoscope\texttrademark}
\end{textblock*}

\begin{textblock*}{18cm}(1.4cm,1.5cm) % {block width} (coords) 
\textcolor{GJBlue}{\footnotesize \\ Artificial Intelligence formulated this projection for compatibility purposes from the original article published at Global Journals. However, this technology is currently in beta. \emph{Therefore, kindly ignore odd layouts, missed formulae, text, tables, or figures.}}
\end{textblock*}


\begin{textblock*}{10cm}(1.05cm,3cm)
{{\textit{CrossRef DOI of original article:}} \underline{}}
\end{textblock*}\let\tabcellsep& 	 	 		 \par
? In section 1, we discussed algorithmic vs human intelligence, and the purpose of SN-Logic.\par
? In section 2, we present the two-person (human H, AI agent A SN ) cooperative Iterated Questioning (IQ) game's role, from both H's and A SN 's perspectives\par
? In section 2.3, we discuss the dynamic drift problem: coping with the changing human understanding of a given complex challenge, using a dynamic optimization process. It's impossible to clearly define a single problem, in complex challenges (e.g. war on drugs) so that they can last for decades\par
? In sections 3.1-3.2, we discuss SN-Logic's requirements to cope with insight (which involves causality, information, logic, probability, uncertainty and utility) and the spaces over which SN-Logic operates\par
? In sections 3.3-3.4, we introduce SN-Logic's grammar: semantics + syntax The syntax is used by question generators, to build millions of possible questions\par
? In section 3.5, we present SN-Logic predicates of two classes: problem difficultyminimizing, and solution quality-maximizing, used in all inferences\par
? In section 3.6, we discuss the complexity and scope of SN-Logic, and section 3.7 highlights the distinction between knowledge acquisition (symbolic AI) and cooperative (machine) learning, both present in our AI\par
? In section 3.8, we introduce the normal form for making SN-inferences, about a question's insightfulness\par
? In section 4, we introduce the Insight Gain Tensor µ(when, where, what, which) to select sound inferences, from the many valid normal-form inferences, and measures of insight gains associated to these questions\par
? In section 5, we illustrate the use of SN-Logic, and we perform a validation test, to show how SN-Logic/IQ-game helps finding a solution path, to a component of a hard real-world solved case (quantum field theory research topic)\par
The Iterated Questioning or IQ game, is described in paper I. During a game session, the AI-agent, A SN , poses the human player H, a question q ? Q, it thinks is most insightful, given H's current cognitive mindset C(t). H then explores it, and reports if it was insightful. These are the game's cooperative policies, both players agree to adopt for each Q\&A episode. The game serves several purposes which benefits both players (positive-sum game) \hyperref[b6]{[7,}\hyperref[b8]{9]} For the human player, H, the IQ-game has the following main roles:\par
? The IQ-game is a Q\&A process that reduces uncertainty and increases information about a specific problem, via a sequence of Q\&As. It provides an effective tool, to gain insight on the many aspects of a complex challenge.\par
? The IQ-game drives a sequential (mostly left-hemispheric) conscious reasoning for solving well-defined (narrow) tasks. This process is mirrored by algorithmic AI. For complex tasks, this process alone fails to deliver full solutions. Conceptual solutions to such problems require the next process: insight-gaining. 
\section[{II. Two-Person Cooperative IQ-Game}]{II. Two-Person Cooperative IQ-Game}\par
a) IQ-game: Human player perspective insight-gains (see paper I \hyperref[b7]{[8]}): built by combining information, probability, uncertainty \hyperref[b5]{[6]} and utility \hyperref[b6]{[7]}. This paper is structured as follows:\par
7. Von Neumann, J. and Morgenstern O. (1944) Theory of Games and Economic Behavior, Princeton University Press: Princeton, NJ. 
\section[{Ref}]{Ref}\par
? The IQ-game drives a parallel (mostly right-hemispheric) non-conscious process, for gaining insights leading to an 'aha' moment. Largely non-conscious processing can be used, where the first process proves too slow or impossible (task is too broad, ill-defined and complex).\par
? The IQ-game is driven by dual goals: minimizing obstacles and maximizing solution qualities. The minimizing questions guide H to eliminate or reduce difficulties in the problem, when possible. The maximizing questions guide H to boost specific solution qualities, when constraints allow it. It is a dynamic optimization (changes with H's understanding). We discuss this process in section 3.4.\par
? The IQ-game provides a non-brittle reasoning framework, which continuously adapts to the human player H's cognitive intentions C. This mindset C evolves as H's understanding of the challenge progresses. The IQ-game copes with the framework drift problem (section 2.3).\par
For the AI-agent, A SN , the IQ-game has these roles:\par
? The IQ game produces game session episodes, from which the agent A SN can learn via cooperative learning.\par
? The IQ game ensures the agent remains human-aligned \hyperref[b9]{[10]}, because of the continuous human judgments. What is useful, informative, insightful for a human player H, does not necessarily mean the same for A SN , even if it starts that way. In the learning process, these values can drift apart, due to many factors. In the IQ game, human valuation is the ultimate arbiter, for the insight value of a question (since any AI short of a full AGI superintelligence, will fail miserably at this task), while SN-Logic estimates the insight values, given C(t).\par
? The IQ game taps into a most valuable human resource: our collective evidence-based knowledge, undeniably our greatest accomplishment (culture, science, technology).\par
Note that our collective belief-based human selections are often poor (e.g. who we put in power as our leader). The forces here are complex and evolutionary: desire for control, cognitive biases and herd mentality from the fear of social isolation (e.g. \hyperref[b10]{[11]}).\par
These factors are absent in the IQ procedure, since decisions are individual, and based directly on one's own experience of a question's insight, within a very specific cognitive context C(t). It uses direct evidence-based judgment, where H's main incentive is to make life easier for herself. There are, of course individual variations in the experienced insightfulness of questions, but only stable patterns (across many individuals) are retained in cooperative learning (not presented in this paper). A complex challenge is typically time-evolving, multi-objective, multi-solution, multidiscipline, multi-level and open-ended, making it hard from the start, to clearly define a single problem, even when it is urgent (e.g. a crisis) or critical (e.g. sustainability), or both (e.g. a pandemic) Instead, there is a drift in the framing of problem and its solutions, as we accumulate new insights about a challenge: a framework drift problem. The drift cannot be handled with a static AI/ML system, focused on a given narrow problem.\par
The IQ-game, copes with the framework drift, by using an adaptive reasoning framework, and an adaptive cognitive intention C = \{f ramework, where, when, what\} (section 3.3-3.4) which tracks the human player H's current understanding of the conceptual framework. It follows H's evolving understanding of the challenge, helping the SN-logic suggest the insightful questions, within each context C. The IQ-game doesn't define a problem from the start, but instead, let's H describe the Standard Logic Programming (predicate logic) is very effective when making strict deductions, but it cannot cope with the cooperative 2-person IQ-game. The purpose of SN-Logic is to provide an inference engine with the following requirements: it has to be ...\par
? precise (ambiguity-free) semantics axioms\par
? consistent (contradiction-free) framework within which, all SN-inferences can be made (normal-form inferencing)\par
? transparent (natural language, no hidden layers)\par
? explainable (no unjustifiable moves)\par
? human-aligned (no conflicts of with human cognitive intentions)\par
? non-brittle able to cope with fundamental concepts related to human-insight: causality (causes of insight), time-dependence (evolving understanding), information, probability, uncertainty  {\ref (Shannon)}, utility (von Neumann), and insight (paper I). Brittleness is a common cause of AI failures.\par
To satisfy these requirements, we need a consistent set of SN-Logic definitions, axioms and rules, to which we now turn.\par
To reason using a predicate logic (such as SN-Logic), the variables x need spaces X, to scope the quantification: ?x ? X, ?x ? X. SN-Logic's concepts are partitioned in six compact concept spaces, over which we can perform inferences (see appendices A-F):\par
Five vector spaces \{T, S D , S C , S G , S S \}, are used to describe the human player H's changing cognitive mindset C(t), during the IQ-game. The AI agent, A SN , needs to know C(t), because the insightfulness of a question, depends on H's increasing understanding of the challenge and its possible solutions, as insight is accumulated.\par
The (tensor product) space S A , of possible conceptual actions (operation x object) provide the raw material to build conceptual solutions.  
\section[{Notes}]{Notes}\par
? Vector space T of exploration stages: vector variable [when ? T ] describe the current stage when of the exploration cycle. The vector [when] rotates in T over time (appendix A). SN-Logic's role, is to provide guidance for insight-building via a Q\&A process: suggesting when/where to pose which questions about what topic. To be used in inferences, the meanings of the parts of speech (variables \{when, where, what, which\}), and the sentence structure (questions which ? q ? Q), have to be both consistent and precise.\par
A SN needs a basic grammar (syntax, semantics, vocabulary) to communicate effectively with the human player H, in a consistent and precise manner. SN-Logic is based on four consistent (contradiction-free) axioms, to define its semantics precisely (ambiguity-free).\par
Let the human-player H's cognitive mindset C(f ramework, p) be defined by the current reasoning f ramework (next section), and three (intention) parameters: p = \{when = p 1 , where = p 2 , what = p 3 \}, then:\par
(Sem 1) Shannon-informative questions: a question (which) q(p, action), that reduces uncertainty (Shannon entropy) for H, who's mindset is C(f ramework, p) (Sem 2) Neumann-useful questions: a question (which) q(p, action), that has a human-aligned (via the 2-person IQ-game) utility, within a mindset C(f ramework, p). It helps H make progress towards a solution.\par
(Sem 3) SN-insightful questions: question (which) q(p, action) satisfying (Sem 1, Sem 2) is SN-insightful, within a mindset C(f ramework, p), otherwise it is SN-insightless.  
\section[{Notes}]{Notes}\par
These SN axioms of semantics, allow the AI to cope with core concepts of causality (causes of insight), dynamics (changing reasoning frames) information, probability, uncertainty \hyperref[b5]{[6]}, utility \hyperref[b6]{[7]} and insight (paper I). These are necessary components of an insight-boosting AI. The axioms Sem1, Sem2 restrict the form of allowed questions. This constraint is used by a Q-generator of questions q ? Q, to which we now turn.\par
The cooperative IQ-game is driven by dual-objectives: to minimize the problem's causes of difficulty, and to maximize the solution's quality. The optimization must continuously adapt to H's understanding of the challenge, over an IQ-game session).\par
The SN-grammar has a simple syntax, specified for each question class Q. All questions q ? Q will fall into two classes Q = \{Q min , Q max \}, from two complementary (dual) perspectives: (a) causes of cognitive difficulty (to minimize), (b) qualities of solution (to maximize). Each question class generates many of specific questions, aimed at making insight-gains.\par
The purpose of SN-Logic is to incrementally boost our insight about solutions, by suggesting when/where to pose which types of questions about what topic, while adapting to a moving target: our current understanding the obstacles in a challenge\par
The question generator, or Q-gen, of difficulty-minimizing questions, uses a specific syntax for an evolving cognitive mindset C min (f rame, topic, p 1 , p 2 , p 3 ). There is a lot of freedom in which questions to pose, even at a specific place and time, within a well-defined framework. We select a set of six commonly useful problemsolving questions, to illustrate the procedure. Q-Gen Syntax: difficulty-minimizing questions q(p, action) ? Q min q min1 : at what exploration stage are we in now? (specifies when = p 1 ? T ) q min2 : what reasoning frame are we operating in, now? (specifies [frame]) q min3 : what topic in [frame] are we focusing on, now? (specifies [topic]) q min4 : where does the main difficulty reside? (specifies where = p 2 ? S D ) q min5 : what, more specifically, causes this difficulty? (specifies what = p 3 ? S C ) q min6 : can you reduce the difficulty (where) and avoid its causes (what), by using these actions? (specifies action ? S A and which = q min6 ? Q min ) 
\section[{The variable [action] (? S}]{The variable [action] (? S}A ? O P × O b ), is a product [verb operation] (? O p ) x [noun object] (? O b ) ( 
\section[{appendices and section 5).}]{appendices and section 5).}\par
The [frame] variable, labels the reasoning framework currently being used (e.g. a discipline, a subject, a specialty, a model, a system, a theory, a technology etc.). This framework can change from one exploration stage to the next. It is a moving target, which mirrors our current understanding of a complex challenge.\par
The [topic] variable, labels a set of items we're focusing on, within [frame] (e.g. agents, assumptions, bounds, properties, qualities, relations, statements, strategies, tactics, techniques etc.). Typically, [topic] is a tool we use within [frame], to make progress. For a concrete example, see section 5.\par
Questions q ? Q min are SN-insightful, only if they are SN-informative (axiom Sem 1): they attempt to reduce a maximum possible amount of uncertainty (alternatives, ignorance, options, possibilities), within the context C min .\par
The generator of quality-maximizing questions, uses a specific syntax for an evolving cognitive mindset C max (f rame, topic, p 1 , p 2 , p 3 ): © 2022 Global Journals 
\section[{Ref q max1}]{Ref q max1}\par
: at what exploration stage are we in now? (specifies when = p 1 ? T ) q max2 : what reasoning frame are we operating in, now? (specifies [frame]) q max3 : what topic in [frame] are we focusing on, now? (specifies [topic]) q max4 : where do you need a boost (goal)? (specifies where = p 2 ? S G ) q max5 : what solution aspect, do you want to focus on? (specifies what = p 3 ? S S ) q max6 : can you boost your goal (where) and the solution's quality (what), by using these actions? (specifies action ? S A and which = q max6 ? Q max ) Questions in Q max are SN-insightful, only if they are SN-informative (axiom Sem 1): they attempt to reduce a maximum amount of uncertainty (alternatives, ignorance, options, possibilities), within the context C max . They are specificityboosting questions which reduce uncertainty (Shannon entropy) to increase the solution's quality.\par
The SN concept of insight involves notions in information, logic, probability, uncertainty and utility (see paper I). To cope with these, we need a logic with quantifiers for scoping the variables x to specific spaces X. In standard predicate logic, a predicate is a function p of a variable x, which maps a variable x ? X, into the predicate's truth values \{T, F \} \hyperref[b11]{[12]}.X ? \{T, F \} and x ? X ? p(x) = T or F\par
In SN-Logic, an SN-predicate is a a function q of a variable x, which maps a variable x ? X, into the predicate's insight values \{insightf ul I + , insightless I 0 \}. X ? \{I + , I 0 \} and x ? X ? q(x) = I + or I 0\par
In SN-Logic we define the two classes (minimizing, maximizing) of predicates q(x), the mindset parameter p ? P ? \{when, where, what\} and the predicate variable 'cognitive action':\par
? SN-predicate questions q(p, action) ? Q min , where p ? P , action ? S A ? SN-predicate questions q(p, action) ? Q max , where p ? P , action ? S A The parameter p ? P is in the space P of cognitive mindsets C min (f ramework, p): the set of H's intentions, during the IQ-game. The AI needs to know this intent, to make useful cooperative suggestions. The mindset parameter p, encodes the type of insight, H wants to boost, at any given time. Thus, the number of distinct classes of challenges SN-Logic can cope with, is effectively infinite (N = 10 7 !), yet, based on a few small, compact concept spaces (cardinality ? 10 2 ). In this sense, SN-Logic is economical (Occam's razor).\par
The computed complexity of SN-Logic is a theoretical upper bound, to determine the scope of SN-Logic. In practice the computational cost will be much lower, due to universal constraints (common to all challenge classes), because they are imposed by (mostly) challenge-independent forces:\par
? causality: universal root causes of cognitive difficulties (e.g. confusion due to ambiguity, indecision due to missing information) and solution quality (e.g. accuracy, adaptability)\par
? logic: valid inferences with sound semantics\par
? planning: logically necessary chronology of solution steps\par
? problem-solving: universal tactics to minimize obstacles (to avoid/reduce), and maximize solution quality (to target/increase/maximize) (e.g. divideand-conquer, minimize ambiguity, maximize order, simplify)\par
? information: a question is only informative, if it reduces uncertainty by eliminating alternatives, options, outcomes, possibilities, within a cognitive mindset (intention) C, restricting the insightful questions to a manageable subset:q ? Q * (C) ? Q, with Card(Q * (C)) << Card(Q)\par
? utility: a question is only useful, if it helps H, overcome obstacles, given a cognitive intention C, restricting the insightful questions to a manageable subset:q ? Q * (C) ? Q, with Card(Q * (C)) << Card(Q)\par
These rules impose a lot of structure on the SN-agent's insight grain tensor µ(f rame, topic, when, where, what, which), which is, in its fully general form, a high-dimensional rank-6 tensor, but is in practice, very sparse and decomposable into simpler tensors and convolution kernels.\par
The structure imposed by the universal (challenge class-independent) constraints, is sufficient to construct factored ('vanilla') tensors µ * of much lower dimensions and lower rank: knowledge acquisition. A 'flavor' is then learned to fine-tune the tensors to each class of challenge, via cooperative learning (not described in this paper). Given the complexity upper-bounds of SN-Logic, the fine-tuning possibilities are vast.\par
A SN 's fundamental problem, is to use the IQ-game, to guide a human player H, in when and where, to pose which types of questions about what topic, to gain a maximum amount of insight into a complex challenge.\par
A standard normal form inferencing (analogous to conjunctive and disjunctive normal forms, in digital and predicate logic), is necessary for the AI to cope with the computational complexity of SN-Logic. The AI can efficiently search for predicate variables action ? S A , used as building-blocks for conceptual solutions. Given an evolving inferencing framework (frame, topic), SN-normal forms are the following: These numbers already compare favorably to a typical human problem-solver H, working by herself. But the real power of SN-Logic (its scope of applications), comes from the combinatorial possibilities: the possible combinations and permutations of insight-boosting questions, needed to solve each class of challenges:© 2022 Global Journals 
\section[{g) Symbolic AI (knowledge acquisition) vs Learning h) SN-Logic Normal Form}]{g) Symbolic AI (knowledge acquisition) vs Learning h) SN-Logic Normal Form}\par
Notes SN normal-form for minimizing inferences Given a minimizing mindset C min (f rame, topic, p), where p ? P = \{when, where, what\}: if ? action ? S A , such that µ min (f rame, topic, p, action) > µ crit , then q(p, action) ? Q * min (C min ) ? Q min , and q(p, action) is SN-insightful, within C min 
\section[{SN normal-form for maximizing inferences}]{SN normal-form for maximizing inferences}\par
Given a maximizing mindset C max (f rame, topic, p), where p ? P = \{when, where, what\}:if ? action ? S A , such that µ max (f rame, topic, p, action) > µ crit , then q(p, action) ? Q * max (C max ) ? Q max ,\textbf{and}q(p, action) is SN-insightful, within C max\par
The sets Q * (C), are maximum-insight subsets of Q min or Q max , and µ(f rame, topic, p, action) is an insight-gain tensor (discussed shortly) whose insight gains are above a minimum critical cutoff µ crit . The purpose of an insight-gain cutoff scale is intuitive, but its mathematical justification is outside the scope of this paper, which focuses only on logical validity, and ignores scientific soundness. The cutoff is related to a scale-invariance due to a conformal symmetry, under the renormalization of probabilities (unitarity). Scale-separation is used in quantum field theories \hyperref[b12]{[13]}, but justified by the conformal symmetry \hyperref[b13]{[14]} of a renormalization group \hyperref[b14]{[15]}.\par
To perform successful inferences autonomously, the AI agent needs to possess the means of deciding whether a predicate variable action ? S A , leads to insight gains above a minimum lower bound (that is, action ? S * A (C) ? S A ). The insightgain tensor provides the SN-agent, the ability to select sound inferences, from a vast number of merely, valid ones (that is, of SN normal-form).\par
The AI performs SN normal-form inferences, to suggest insightful questions to explore, given human-targeted insight gains C(p). These 'most insightful' questions, lie in a restricted subspace Q * (C) = \{Q * min (C min ), Q * max (C max )\}, within a large space Q, of possible questions (Card(Q) = 10 7 ). Given a current mindset C(p), A SN must find a subspace of questions Q * (C). This is where an insight-gain measure µ(p, action) (convolution tensors and their kernels, used to restrict searches to optimal sub-spaces) are essential, to make sound inferences (real-world accurate), rather than merely valid ones (SN normal-form inferences). This will be presented elsewhere. For now, we simply discuss general constraints imposed by SN-Logic, on the tensor elements. The AI's capacity to generate SN-insightful I + questions, from a vast possibility of insightless I 0 ones (with actions ? S A ), resides in the structure a highdimensional insight-gain tensor µ(when, where, what, which) ? µ(p, action), for each challenge class and reasoning frame. So the full rank-7 tensor is actually µ(class, f rame, topic, p 1 , p 2 , p 3 , action). This function outputs the value g of insight gain associated to exploring a question which ? q(p, action) ? Q, where p ? P encodes H's targeted insight gains. To be useful, the tensor µ is required to satisfy the following properties:? µ : Cl × F r × P × S A ? [0, 1],\par
where Cl = set of challenge classes, F r = set of reasoning frameworks (frame+topic),P = T × S 1 × S 2 , S A = O p × O b , S 1 = S D or S G , and S 2 = S C or S Q ? it is a measure of insight gain µ(class, f rame, topic, p, action) = g ? [0, 1] (normalized)\par
? probability of all possible actions with a mindset p, must sum to one (unitarity)? µ crit ?]0, 1[ (minimum critical insight-gain value µ > µ crit )\par
? g = 0 when q(p, action) is SN-insightless I 0 , given the mindset p\par
? g = 1 when q(p, action) is maximally SN-insightful I + , given the mindset p\par
? µ is initialized by satisfying heuristics from causality, information, logic, planning, problem solving and utility. These constraints provide the initial (challenge class-independent) approximation for µ\par
? µ gets optimized (fine-tuned) for specific classes of challenges, by cooperative learning, using the IQ-game's session episodes © 
\section[{Notes}]{Notes}\par
We can now illustrate how SN-Logic is used, on a real challenge. In the IQ-game, both players (human: H, A SN ) agree to use simple cooperative strategies, given H's current mindset C:\par
(1) A SN suggests its guess at a most insightful question (q ? Q * (C))\par
(2) H reports questions q she actually finds insightful The game's Q\&A session, cycles over each obstacle, encountered within a challenge. Hundreds of such sub-problems may be encountered, to solve a challenge. Usually, the number and nature of these obstacles is unknown ahead of time, in real-world challenges.\par
For clarity, we use a single, static, not so complex, yet most difficult challenge. The scenario is: a young post-doctoral researcher, H, is trying to find a good quantum field topic, to spend her next ten years on. The first few moves (Q\&As) of the two-person IQ-game, could proceed as follows: A by H: 'I want to identify the current obstacle'Q from A SN : 'Greetings! What2. Q from A SN : 'What is our current reasoning framework ? (AI is using q min2 in Q-generator)\par
The framework is composed of a topic and a frame 
\section[{Notes}]{Notes}\par
The topic can be any useful tool we select, for overcoming the obstacle (select the closest match):  The reasoning frame is the clearly-defined context, within which topic is being used  {\ref (} A by H: For my research direction, I want to identify a weakness in quantum field theory (QFT) (so here, [frame] ? theory, and [topic] ? qualities). A from H: 'I find some questions quite insightful, because (click on each insightful one, and note the reasons for your record):actions e. 
\section[{Q from}]{Q from}\par
I outlined the implications of QFT (e.g. including matrix unitarity), and QFT's experimental tests (e.g. including neutron decay experiments). I found reported incompatibilities (e.g. known violations of the CKM matrix's unitarity \hyperref[b15]{[16]}, in neutron decay experiments \hyperref[b16]{[17]} ). That seems like an interesting research area of quantum field theory, for me. This scenario shows how suggested questions from A SN , can replicate realworld solutions to obstacles, via a cooperative Q\&A dialog. The researchers do something similar between themselves, early-on, to decide what to work on. But AI's complementary strength, is to cover many exploration paths, which are very often overlooked, yet may be key to quality solutions. This dynamic 'human-AI' interaction would be even more fruitful, in a group brainstorming session, where each member of the team, can select directions to explore and possible answers.\par
We mentioned (section 3.7), that insight-gain convolution tensors and kernels, form the bridge between the SN normal form inferencing (SN-validity), and measures of insight (SN-soundness); the bridge between logic (validity) and science (soundness). Initially, the tensors µ are the AI's 'vanilla' core, then, learned flavors are added to it, via machine learning to optimize the core AI, to distinct challenge classes.\par
The AI's core will be initialized by heuristics from causality, information, logic, planning, problem-solving, and utility. These apply to all types of challenges. The tensors' added flavor, needs to be learned using cooperative learning via a renormalization procedure, from the IQ-game's episodes. The construction of the insightgain tensors and cooperative learning will be described in future work.  
\section[{VI. Discussion}]{VI. Discussion} 
\section[{Ref}]{Ref}\par
We presented the foundations of SN-Logic, designed to boost human insight, to help overcome challenges that are hard to deal with, using traditional AI (mainly, predicate logic and deep learning neural nets). This required a logic, capable of coping with the concepts necessary to measure insight-gains: causality (causes of insight gains), dynamics (adaptive reasoning frameworks), information, probability, uncertainty  {\ref (Shannon)} and utility (von Neumann).\par
In this paper, we presented the following:\par
? The two-person (H, A SN ) cooperative IQ-game's role from both H's and A SN 's perspectives\par
? The frame drift problem: coping with the changing understanding of a challenge, using a (non-brittle) logic and optimization process, which continuously adapt to the current human understanding and intention\par
? SN-Logic's requirements to compute insightfulness (which involves causality, information, logic, probability, uncertainty and utility) and the concept spaces over which SN-Logic operates (to scope the quantifiers)\par
? SN-Logic's grammar: semantics + syntax for posing questions q ? Q from a vast space of potential questions. The syntax is used by a dual question generator (q ? Q min , q ? Q max ), from which all questions are built (N ques = O(10 7 ))\par
? SN-Logic predicates of two question classes: problem difficulty-minimizing, and solution quality-maximizing, used in all inferences\par
? The complexity of SN-Logic, and show it's broad scope and capability of coping with a large number of distinct challenge classes.\par
? The SN normal-form for making valid inferences, about a question's insightfulness, efficiently within a vast space of possibilities 
\section[{b) Conclusion}]{b) Conclusion}\par
Issue ersion I\par
V IV ( F )\par
? Insight Gain Tensors µ(when, where, what, which) are necessary to select sound inferences (real-world accurate), from a vast (effectively infinite) number of valid ones (those with SN normal-form). µ measures the human insight gains, associated to questions posed, within their cognitive mindsets (C min , C max )\par
? A validation test, to show that SN-Logic can replicate the solution steps, to a real-world solved case (discovery in quantum field theory)\par
This paper focused solely on logic and validity of SN-inferences. It has not dealt with the equally important issue of scientific soundness and accuracy. We will present the construction of the insight-gain convolution tensors and kernels, and the learned structure (cooperative learning), in future papers.\par
A: Vector Space of Exploration Steps T (sample) \begin{figure}[htbp]
\noindent\textbf{4}\includegraphics[]{image-2.png}
\caption{\label{fig_1}(Sem 4 )}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-3.png}
\caption{\label{fig_2}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{34}\includegraphics[]{image-4.png}
\caption{\label{fig_3}3 ? 4 ?}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-5.png}
\caption{\label{fig_5}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{}\includegraphics[]{image-6.png}
\caption{\label{fig_7}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{P{0.85\textwidth}}
? Vector space S C of difficulty causes: vector variable [what ? S C ] de-\\
scribes what in the reasoning's framework, is causing H difficulty. The\\
vector [what] rotates in S C over time while exploring the challenge (ap-\\
pendix C).\\
? Vector space S G of mental goals: vector variable [where ? S G ] describes\\
the solution quality, H intends to improve. The vector [where] rotates\\
in S G over time while exploring the challenge (appendix D)\\
? Vector space S S of solution elements: vector variable [what ? S S ] de-\\
scribe what aspect of the solution, H intends to improve. The vector\\
{}[what] rotates in S S over time while exploring the challenge (appendix\\
E)\\
?\end{longtable} \par
 
\caption{\label{tab_0}?}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{P{0.85\textwidth}}
To compose something To compute something To construct something To design something To discover something To govern something To invent something To manage something To optimize something To predict something To reconstruct something e.g. intelligence, inverse problems, sensing e.g. music, arts, literature, programming e.g. any domain e.g. any domain e.g. engineering, technology e.g. science, mathematics e.g. crisis mitigation, leadership e.g. engineering, science, technology e.g. corporate, government e.g. any domain e.g. any domain To solve something e.g. any domain A by H: Boosting Human Insight by Cooperative AI: Foundations of Shannon-Neumann Logic\\
to specify a current obstacle\\
to minimize the obstacle\\
to explore solution ideas\\
to question a solution idea\\
to verify a solution idea\\
V. Validation Test: Post-Doc Researcher's Dilemma\end{longtable} \par
 
\caption{\label{tab_1}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{P{0.25664251207729466\textwidth}P{0.5933574879227053\textwidth}}
discipline\tabcellsep e.g. molecular biology\\
subject\tabcellsep e.g. protein folding\\
context\tabcellsep e.g. social revolution\\
\multicolumn{2}{l}{environment e.g. location and time}\\
event\tabcellsep e.g. activity or pandemic crisis\\
model\tabcellsep e.g. just-in-time supply-chains\\
principle\tabcellsep e.g. quantum computing\\
method\tabcellsep e.g. optimization\\
network\tabcellsep e.g. communication or transport\\
theory\tabcellsep e.g. general relativity\\
specialty\tabcellsep e.g. programming\\
system\tabcellsep e.g. quantum communications\\
technology ...\tabcellsep e.g. fresh water extractor\end{longtable} \par
 
\caption{\label{tab_3}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{P{0.0017649501661129569\textwidth}P{0.7825789036544851\textwidth}P{0.051889534883720924\textwidth}P{0.013766611295681061\textwidth}}
\tabcellsep \multicolumn{2}{l}{5. Q from A (explore any question you think is promising, or move-on)}\\
\tabcellsep \multicolumn{2}{l}{(AI is using q min6 in Q-generator + SN normal-form inferences + insight-gain}\\
Notes\tabcellsep \multicolumn{2}{l}{tensors/kernels) by exploring: idealized cases of the theory (QFT)}\tabcellsep Notes\\
\tabcellsep \multicolumn{2}{l}{solved cases of the theory (QFT)}\\
\tabcellsep \multicolumn{2}{l}{simple cases of the theory (QFT)}\\
\tabcellsep by outlining:\tabcellsep \\
\tabcellsep \multicolumn{2}{l}{consequences (causal) of the theory (QFT)}\\
\tabcellsep \multicolumn{2}{l}{implications (logical ) of the theory (QFT)}\\
\tabcellsep \multicolumn{2}{l}{predictions (temporal ) of the theory (QFT) tests (experimental ) of the theory (QFT) by identifying:}\tabcellsep ersion I V\\
\tabcellsep \multicolumn{2}{l}{inconsistent aspects of the theory (QFT)}\tabcellsep IV\\
\tabcellsep \multicolumn{2}{l}{limitations of the theory (QFT) problematic aspects of the theory (QFT)}\tabcellsep Issue\\
\tabcellsep \multicolumn{2}{l}{inability to apply inability to compute inability to construct uncertain aspects of the theory (QFT) [topic] in/of [frame] [topic] in/of [frame] unjustified aspects the of theory (QFT) untested aspects of the theory (QFT) by looking for: ambiguities (imprecision) contradictions (logical, evidence) [topic] in/of [frame] inability to decide [topic] in/of [frame] inability to evaluate counter-examples (exceptions) discrepancies (differences) [topic] in/of [frame] inability to exploit dogma (cognitive traps) [topic] in/of [frame] inability to identify errors (math, procedures) [topic] in/of [frame] inability to select falsehoods (logical) [topic] in/of [frame] inability to simplify flaws (procedure, reasoning) [topic] in/of [frame] inability to solve gaps (missing pieces) [topic] in/of [frame] implicit assumptions (reasoning) inability to understand [topic] in/of [frame] impossibilities (logical, physical)}\tabcellsep Volume XXII ( F )\\
\tabcellsep \multicolumn{2}{l}{inaccuracies (scientific, technical) A by H: I can't evaluate the weaknesses [topic = qualities] of quantum field incompatibilities (between two items) theory [frame = theory] inconsistencies (logical)}\\
\tabcellsep \multicolumn{2}{l}{limitations (scope of applicability) unexplained items (no explanation) unjustified items (lack justification) 4. Q from A missing comparison for unsupported items (lack evidence) [topic] in/of [frame] missing constraint on violations (law-breaking) [topic] in/of [frame] missing criterion for [topic] in/of [frame] weaknesses (logical)}\\
\tabcellsep missing direction in\tabcellsep {}[topic] in/of [frame]\\
\tabcellsep \multicolumn{2}{l}{missing information about [topic] in/of [frame]}\\
\tabcellsep missing intuition for\tabcellsep {}[topic] in/of [frame]\\
\tabcellsep missing knowledge of\tabcellsep {}[topic] in/of [frame]\\
\tabcellsep missing metric for\tabcellsep {}[topic] in/of [frame]\\
\tabcellsep missing ranking of\tabcellsep {}[topic] in/of [frame]\\
\tabcellsep missing standard for\tabcellsep {}[topic] in/of [frame]\\
\tabcellsep missing value of\tabcellsep {}[topic] in/of [frame]\end{longtable} \par
  {\small\itshape [Note: A by H: 'I lack an intuition for the weaknesses of QFT']} 
\caption{\label{tab_4}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{P{0.85\textwidth}}
7. Q from A\\
ersion I V\\
IV\\
Issue\\
Volume XXII\\
( F )\\
Frontier Research\\
of Science\\
Global Journal\end{longtable} \par
 
\caption{\label{tab_5}}\end{figure}
 \begin{figure}[htbp]
\noindent\textbf{} \par 
\begin{longtable}{P{0.024038145346925353\textwidth}P{0.6540611640907595\textwidth}P{0.11236435383097663\textwidth}P{0.052548503781650775\textwidth}P{0.006987832949687602\textwidth}}
Notes\tabcellsep clarity about the level of ambiguity of confidence in the level of complexity of construction of the level of dependencies in criticism of the level of flaws in exploitation of the level of fragmentation of imagination for the level of implicitness in intuition for the level of impracticality of understanding of the level of imprecision of etc.\tabcellsep \multicolumn{2}{l}{[solution item] [item] [solution item] [item] [solution item] [item] [solution item] [item] [solution item] [item] [solution item] [item] [solution item] [item] [solution item] [item] [item]}\tabcellsep \\
\tabcellsep level of incompleteness of\tabcellsep {}[item]\tabcellsep \tabcellsep \\
\tabcellsep level of inconsistency in VII. Appendices level of indecision about\tabcellsep {}[item] [item]\tabcellsep \tabcellsep \\
\tabcellsep level of indetermination in\tabcellsep {}[item]\tabcellsep \tabcellsep \\
\tabcellsep level of inefficiency of\tabcellsep {}[item]\tabcellsep \tabcellsep \\
Global Journal of Science Frontier Research Volume XXII Issue ersion I V IV ( F )\tabcellsep Time basis vector: when ? p 1 ? T ) to identify an obstacle to minimize the obstacle to explore solution ideas to question a solution idea to verify a solution idea inability to classify inability to compute inability to connect inability to construct inability to count inability to decide inability to design inability to eliminate inability to evaluate inability to exploit inability to extract inability to identify inability to interpret inability to organize inability to perform inability to plan inability to predict inability to rank inability to relate inability to select inability to simplify level of insufficiency of level of uncertainty in level of unpredictability of level of weakness of solution's agents solution's cases solution's components solution's consequences etc. missing assumption about missing bounds on solution's constraints solution's dimensions missing capacity for solution's economy missing classification of solution's efficiency missing confidence in solution's effectiveness missing connections in solution's ethics missing constraints on solution's form missing evidence for missing explanation for missing freedom to solution's framework solution's information solution's justification missing information about solution's methods missing interpretation of solution's plan missing intuition for solution's properties missing justification for solution's qualities missing motivation for solution's relationships missing organization of solution's requirements missing representation of solution's resources missing restriction on solution's restrictions missing scales in solution's space missing statements in solution's statements missing tools for solution's sustainability missing verification of solution's utility solution's value etc. etc.\tabcellsep {}[item] [item] [item] [item] [item] [item] [item] [item] [item] [item] [item] [item] [item] [item] [item] [item] [item] [item] [item] [item] [item] [item] [item] [item] [item] [item]\tabcellsep {}[frame] [frame] [frame] [frame] [frame] [frame] [frame] [frame] [frame] [frame] [frame] [frame] [frame] [frame] [frame] [frame] [frame] [frame] [frame] [frame] [frame]\tabcellsep ersion I V IV Issue ( F )\\
\tabcellsep inability to solve\tabcellsep \tabcellsep {}[frame]\tabcellsep \\
\tabcellsep inability to transform\tabcellsep \tabcellsep {}[frame]\tabcellsep \\
\tabcellsep inability to verify\tabcellsep \tabcellsep {}[frame]\tabcellsep \\
\tabcellsep etc.\tabcellsep \tabcellsep \tabcellsep \end{longtable} \par
  {\small\itshape [Note: B:CNote]} 
\caption{\label{tab_6}}\end{figure}
 			\footnote{© 2022 Global Journals} 		 		\backmatter  			  				\begin{bibitemlist}{1}
\bibitem[Andrews ()]{b11}\label{b11} 	 		\textit{An Introduction to Mathematical Logic and Type Theory: To Truth Through Proof},  		 			P B Andrews 		.  		2002. Berlin: Kluwer Academic Pub. and Springer.  	 	 (2nd ed.) 
\bibitem[Guilhoto ()]{b3}\label{b3} 	 		\textit{An Overview of Artificial Neural Networks for Mathematicians},  		 			L F Guilhoto 		.  		2018.  		 			Univ. Chicago 		 	 
\bibitem[Humphreys ()]{b4}\label{b4} 	 		‘Computed structures of core eukaryotic protein complexes’.  		 			I R Humphreys 		.  		 \xref{http://dx.doi.org/10.1126/science.abm4805}{10.1126/science.abm4805}.  	 	 		\textit{Science}  		2021.  	 
\bibitem[Fromm ()]{b10}\label{b10} 	 		\textit{Escape from freedom, Holt Paperbacks},  		 			E Fromm 		.  		1994.  	 	 (1st Edition) 
\bibitem[Mohri ()]{b1}\label{b1} 	 		\textit{Foundations of Machine Learning},  		 			M Mohri 		.  		2018. 2 nd Ed., Cambridge Massachusetts: The MIT Press.  	 
\bibitem[Guillarmou (2020)]{b13}\label{b13} 	 		 			C Guillarmou 		.  		 arXiv:2005.11530v2[math.PR]11.  		\textit{(2020) Conformal bootstrap in Liouville theory},  				Nov 2020.  	 
\bibitem[Russell ()]{b9}\label{b9} 	 		\textit{Human Compatible: Artificial Intelligence and the Problem of Control},  		 			S Russell 		.  		2019. Viking, New York.  	 
\bibitem[Siregar ()]{b7}\label{b7} 	 		\textit{Learning human insight by cooperative AI: Shannon-Neumann measure},  		 			E Siregar 		.  		2021. IOP Publishing Ltd., SciNotes. 2.  	 
\bibitem[Hornik ()]{b2}\label{b2} 	 		‘Multilayer feed forward networks are universal approximators’.  		 			K Hornik 		.  	 	 		\textit{Neural Networks}  		1989. 2  (5)  p. .  	 
\bibitem[Nash (1953)]{b8}\label{b8} 	 		 			J Nash 		.  	 	 		\textit{Two-Person Cooperative Games},  				1953. Jan., 1953. 21 p. .  	 
\bibitem[Neumann and Morgenstern ()]{b6}\label{b6} 	 		 			Von Neumann 		,  		 			J Morgenstern 		,  		 			O 		.  		\textit{Theory of Games and Economic Behavior},  				 (Princeton, NJ)  		1944. Princeton University Press.  	 
\bibitem[Wilson ()]{b14}\label{b14} 	 		‘Renormalization Group and Critical Phenomena. I. Renormalization Group and the Kadanoff Scaling Picture’.  		 			K G Wilson 		.  	 	 		\textit{Phys. Rev. B}  		1971. 4 p. 3174.  	 
\bibitem[Zyla ()]{b16}\label{b16} 	 		\textit{Review of Particle Physics: CKM quarkmixing matrix, Progress of Theoretical and Experimental Physics},  		 			P Zyla 		.  		 \xref{http://dx.doi.org/10.1093/ptep/ptaa104}{10.1093/ptep/ptaa104}.  		2020. 2020 p. .  	 
\bibitem[Sterling and Shapiro ()]{b0}\label{b0} 	 		‘The Art of Prolog: Advanced Programming Techniques’.  		 			Leon Sterling 		,  		 			L 		,  		 			Ehud Shapiro 		,  		 			E 		.  	 	 		\textit{Series in Logic Programming)},  				1986. MIT Press.  	 	 (First Ed) 
\bibitem[Shannon and Weaver ()]{b5}\label{b5} 	 		\textit{The mathematical theory of communications},  		 			C Shannon 		,  		 			W Weaver 		.  		1949. Univ. Illinois Press.  	 
\bibitem[Dyson ()]{b12}\label{b12} 	 		‘The radiation theories of Tomonaga, Schwinger and Feynman’.  		 			F Dyson 		.  	 	 		\textit{Phys. Rev}  		1949. 75 p. 486.  	 
\bibitem[Wikipedia: Cabibbo-Kobayashi-Maskawa matrix, m, en.wikipedia. org/wiki/Cabibbo-Kobayashi-Maskawa matrix]{b15}\label{b15} 	 		\textit{Wikipedia: Cabibbo-Kobayashi-Maskawa matrix, m, en.wikipedia. org/wiki/Cabibbo-Kobayashi-Maskawa matrix},  				 	 
\end{bibitemlist}
 			 		 	 
\end{document}
