Giorgi Japaridze

69 papers Journal 68

Year	Rank	Type	Title / Venue / Authors
2026	J	`jnl`	Do not throw out the baby: Clarithmetics as alternatives to weak arithmetics. CoRR Giorgi Japaridze
2024	J	`jnl`	A Propositional Cirquent Calculus for Computability Logic. J. Log. Lang. Inf. Giorgi Japaridze
2024	J	`jnl`	A propositional cirquent calculus for computability logic. CoRR Giorgi Japaridze
2024	J	`jnl`	Thoughts on sub-Turing interactive computability. CoRR Giorgi Japaridze
2021	J	`jnl`	Cirquent calculus in a nutshell. CoRR Giorgi Japaridze, Bikal Lamichhane
2021	J	`jnl`	Elementary-base cirquent calculus II: Choice quantifiers. Log. J. IGPL Giorgi Japaridze
2020	J	`jnl`	Fundamentals of Computability Logic. FLAP Giorgi Japaridze
2019	J	`jnl`	Computability logic: Giving Caesar what belongs to Caesar. CoRR Giorgi Japaridze
2019	J	`jnl`	Elementary-base cirquent calculus II: Choice quantifiers. CoRR Giorgi Japaridze
2019	J	`jnl`	Fundamentals of computability logic. CoRR Giorgi Japaridze
2018	J	`jnl`	Elementary-base Cirquent Calculus I: Parallel and Choice Connectives. FLAP Giorgi Japaridze
2017	J	`jnl`	Elementary-base cirquent calculus I: Parallel and choice connectives. CoRR Giorgi Japaridze
2016	J	`jnl`	A survey of computability logic. CoRR Giorgi Japaridze
2016	J	`jnl`	Build your own clarithmetic I. Log. Methods Comput. Sci. Giorgi Japaridze
2016	J	`jnl`	Build your own clarithmetic II. Log. Methods Comput. Sci. Giorgi Japaridze
2016	J	`jnl`	Introduction to clarithmetic II. Inf. Comput. Giorgi Japaridze
2015	J	`jnl`	On the system CL12 of computability logic Log. Methods Comput. Sci. Giorgi Japaridze
2014	J	`jnl`	Introduction to clarithmetic III. Ann. Pure Appl. Log. Giorgi Japaridze
2013	J	`jnl`	On resources and tasks. CoRR Giorgi Japaridze
2013	J	`jnl`	The taming of recurrences in computability logic through cirquent calculus, Part I. Arch. Math. Log. Giorgi Japaridze
2013	J	`jnl`	The taming of recurrences in computability logic through cirquent calculus, Part II. Arch. Math. Log. Giorgi Japaridze
2012	J	`jnl`	A logical basis for constructive systems. J. Log. Comput. Giorgi Japaridze
2012	J	`jnl`	A new face of the branching recurrence of computability logic. Appl. Math. Lett. Giorgi Japaridze
2012	J	`jnl`	Separating the basic logics of the basic recurrences. Ann. Pure Appl. Log. Giorgi Japaridze
2011	J	`jnl`	A new face of the branching recurrence of computability logic CoRR Giorgi Japaridze
2011	J	`jnl`	From formulas to cirquents in computability logic Log. Methods Comput. Sci. Giorgi Japaridze
2011	J	`jnl`	Introduction to clarithmetic I. Inf. Comput. Giorgi Japaridze
2011	J	`jnl`	The taming of recurrences in computability logic through cirquent calculus CoRR Giorgi Japaridze
2011	J	`jnl`	The taming of recurrences in computability logic through cirquent calculus, Part II CoRR Giorgi Japaridze
2011	J	`jnl`	Toggling operators in computability logic. Theor. Comput. Sci. Giorgi Japaridze
2010	J	`jnl`	A logical basis for constructive systems CoRR Giorgi Japaridze
2010	J	`jnl`	Introduction to clarithmetic I CoRR Giorgi Japaridze
2010	J	`jnl`	Introduction to clarithmetic II CoRR Giorgi Japaridze
2010	J	`jnl`	Introduction to clarithmetic III CoRR Giorgi Japaridze
2010	J	`jnl`	Separating the basic logics of the basic recurrences CoRR Giorgi Japaridze
2010	J	`jnl`	Towards applied theories based on computability logic. J. Symb. Log. Giorgi Japaridze
2009	—	`ch.`	In the Beginning was Game Semantics? Games: Unifying Logic, Language, and Philosophy Giorgi Japaridze
2009	J	`jnl`	Many Concepts and Two Logics of Algorithmic Reduction. Stud Logica Giorgi Japaridze
2009	J	`jnl`	Ptarithmetic CoRR Giorgi Japaridze
2009	J	`jnl`	Toggling operators in computability logic CoRR Giorgi Japaridze
2008	J	`jnl`	Cirquent Calculus Deepened. J. Log. Comput. Giorgi Japaridze
2008	J	`jnl`	Sequential operators in computability logic. Inf. Comput. Giorgi Japaridze
2008	J	`jnl`	Towards applied theories based on computability logic CoRR Giorgi Japaridze
2007	J	`jnl`	Cirquent calculus deepened CoRR Giorgi Japaridze
2007	J	`jnl`	Four concepts and two logics of algorithmic reduction CoRR Giorgi Japaridze
2007	J	`jnl`	From truth to computability II. Theor. Comput. Sci. Giorgi Japaridze
2007	J	`jnl`	Intuitionistic computability logic. Acta Cybern. Giorgi Japaridze
2007	J	`jnl`	Sequential operators in computability logic CoRR Giorgi Japaridze
2007	J	`jnl`	The intuitionistic fragment of computability logic at the propositional level. Ann. Pure Appl. Log. Giorgi Japaridze
2007	J	`jnl`	The logic of interactive Turing reduction. J. Symb. Log. Giorgi Japaridze
2006	J	`jnl`	From truth to computability I. Theor. Comput. Sci. Giorgi Japaridze
2006	J	`jnl`	Introduction to Cirquent Calculus and Abstract Resource Semantics. J. Log. Comput. Giorgi Japaridze
2006	J	`jnl`	Propositional computability logic I. ACM Trans. Comput. Log. Giorgi Japaridze
2006	J	`jnl`	Propositional computability logic II. ACM Trans. Comput. Log. Giorgi Japaridze
2006	J	`jnl`	The intuitionistic fragment of computability logic at the propositional level CoRR Giorgi Japaridze
2005	J	`jnl`	From truth to computability II CoRR Giorgi Japaridze
2005	J	`jnl`	In the beginning was game semantics CoRR Giorgi Japaridze
2005	J	`jnl`	Introduction to Cirquent Calculus and Abstract Resource Semantics. CoRR Giorgi Japaridze
2005	J	`jnl`	The logic of interactive Turing reduction CoRR Giorgi Japaridze
2004	J	`jnl`	Computability Logic: a formal theory of interaction CoRR Giorgi Japaridze
2004	J	`jnl`	From truth to computability I CoRR Giorgi Japaridze
2004	J	`jnl`	Intuitionistic computability logic I CoRR Giorgi Japaridze
2004	J	`jnl`	Propositional Computability Logic II CoRR Giorgi Japaridze
2004	J	`jnl`	Propositional computability logic I CoRR Giorgi Japaridze
2003	J	`jnl`	Introduction to computability logic. Ann. Pure Appl. Log. Giorgi Japaridze
2002	J	`jnl`	The logic of tasks. Ann. Pure Appl. Log. Giorgi Japaridze
2000	J	`jnl`	The Propositional Logic of Elementary Tasks. Notre Dame J. Formal Log. Giorgi Japaridze
1997	J	`jnl`	A Constructive Game Semantics for the Language of Linear Logic. Ann. Pure Appl. Log. Giorgi Japaridze
1994	J	`jnl`	A Simple Proof of Arithmetical Completeness for Π Notre Dame J. Formal Log. Giorgi Japaridze