BEGIN:VCALENDAR
VERSION:2.0
PRODID:researchseminars.org
CALSCALE:GREGORIAN
X-WR-CALNAME:researchseminars.org
BEGIN:VEVENT
SUMMARY:C.B. Wells
DTSTART:20250425T153000Z
DTEND:20250425T163000Z
DTSTAMP:20260422T171805Z
UID:CompMath/13
DESCRIPTION:Title: <a href="https://researchseminars.org/talk/CompMath/13/
 ">Holdea: Visual Logic Interface</a>\nby C.B. Wells as part of Relatorium 
 seminar\n\n\nAbstract\nThere is a simple visualization of logic: relations
  of types are nodes with ports\, equalities are wires connecting ports\, c
 onjunction is juxtaposition\, negation is wrapping in an opposite color\, 
 and entailment is nesting of nodes. This describes the string diagrams of 
 a self-dual cartesian bifibered category\, which models a first-order logi
 c. \n\nI'm creating an interface for visual logic - a user connects data\,
  tables become nodes in the canvas\, and they can form predicates and rule
 s just by manipulating nodes and wires. It's in the early stage\, but the 
 core is established: the visualization generates a prolog query in the sid
 e panel\, executes\, and returns results in the bottom panel. I'll demonst
 rate\, explain some background theory and implementation\, and then open d
 iscussion.\n\nModerator: The talk will be moderated by Nathan Haydon. Nath
 an is a philosopher working on methods of reasoning in logic and science. 
 Much of his work is inspired by Charles S. Peirce\, including Peirce’s p
 ragmatism and Peirce’s formal developments in diagrammatic logic. Along 
 these lines\, Nathan has most recently been working on the logic of string
  diagrams. Finally\, Nathan is also interested in the broader ethical and 
 meta-ethical positions that follow from scientific reasoning.\n
LOCATION:https://researchseminars.org/talk/CompMath/13/
END:VEVENT
END:VCALENDAR