教員情報 - 藤田　憲悦 | 東京電機大学

フジタ　ケンエツ FUJITA Kenetsu
藤田　憲悦

所属東京電機大学大学院理工学研究科理学専攻

職種特別専任教授

学会発表
1.	2025/03/18	On Reynolds–Hurkens–Coquand paradox (日本数学会年会数学基礎論および歴史分科会)
2.	2025/02/19	Reynolds-Hurkens-Coquand Paradox and T-algebras (Kyoto University RIMS Workshop on Semigroups, Algebras, Languages and Related Areas in Computer Science)
3.	2024/02/14	ブーロスの最強のパズルと論理的推論に関する研究 (The Kyoto University RIMS workshop "Group, Algebra, Language and Related Areas in Computer Science")
4.	2023/12/13	2 階直観主義命題論理の解釈と決定可能性に関する考察 (京都大学数理解析研究所RIMS共同研究「証明論と計算論の最前線」)
5.	2023/12/11	Z定理のモジュール性 (京都大学数理解析研究所RIMS共同研究「証明論と計算論の最前線」)
6.	2023/02/16	Boolos' "The Hardest Logic Puzzle Ever" and Coinduction (Kyoto University RIMS Symposium "Group, Ring, Language and Related Areas in Computer Science")
7.	2022/06/23	Introduction to the Curry-Howard isomorphism (Symposium on Advances in Mathematical Logic 2022)
8.	2022/03/28	Spectral Spaces for Models of Intuitionistic Logic (日本数学会2022年度年会数学礎論)
9.	2022/02/17	A general form on the logic puzzle of Boolos (Kyoto University RIMS Workshop (Open) Logic, Algebraic system, Language and Related Areas in Computer Science)
10.	2021/12/20	合流性とZ定理について (京都大学数理解析研究所RIMS共同研究「証明論と計算の理論と応用」)
11.	2021/12/20	Spectral spaces for models of intuitionistic logic (京都大学数理解析研究所RIMS共同研究「証明論と計算の理論と応用」)
12.	2021/09/17	On formalization of logic puzzles a la George Boolos (MSJ, 日本数学会秋季総合分科会)
13.	2021/02/18	On formalization of logic puzzles a la Smullyan (Logic, Language, Algebric System and Related Areas in Computer Science)
14.	2020/09/24	George Boolos' "The Hardest Logic Puzzle Ever" Revisited (日本数学会2020年度秋季総合分科会)
15.	2020/03/09	ラムダ計算における簡約グラフ (ラムダ計算と論理の早春セミナー2020)
16.	2020/03/09	「The Hardest Logic Puzzle Ever」再考 (ラムダ計算と論理の早春セミナー2020)
17.	2020/03/09	Anagoposによるλ項の構造とグラフの対応関係 (ラムダ計算と論理の早春セミナー2020)
18.	2019/12/26	ラムダ計算の簡約グラフについて (証明論とその周辺)
19.	2019/12/26	A monoid-like structure of computational paths for parallel reduction (Proof Theory)
20.	2019/09/20	Equational theory and reduction rules of reduction paths (日本数学会)
21.	2019/03/17	A formal system of reduction paths for parallel reduction (日本数学会2019年度年会)
22.	2019/03/10	ラムダ計算における簡約グラフ (ラムダ計算と論理の早春セミナー2019)
23.	2019/03/10	モデル検査ツールUPPAALによる衝突検知メカニズムの可視化 (ラムダ計算と論理の早春セミナー2019)
24.	2019/03/10	A formal system of reduction paths for parallel reduction (ラムダ計算と論理の早春セミナー2019)
25.	2019/03/07	Z定理を用いたλμ計算の合流性証明 (日本ソフトウェア科学会 PPL2019)
26.	2018	The Church--Rosser Theorem and Quantitative Analysis of Witnesses (Mathematical Society of Japan)
27.	2018	The Church--Rosser theorem and analysis of reduction length (48th TRS Meeting)
28.	2018	Quantitative Analysis of Reduction Length (JSPS Core-to-Core Program: Second Workshop on Mathematical Logic and its Applications)
29.	2018	A formal system of reduction paths for parallel reduction (49th TRS meeting)
30.	2018/09	A constructive proof of the Church--Rosser theorem (Workshop on Type Theory and Lambda Calculus)
31.	2018	A constructive proof of the Church--Rosser theorem (End-of-summer Logic Minisymposium)
32.	2017	Z for call-by-value (6th International Workshop on Confluence)
33.	2017	Z for Call-by-Value (RIMS, Proof Theory and Proof Activity)
34.	2017	The Church--Rosser Theorem and Analysis of Reduction Length (RIMS, Proof Theory and Proof Activity)
35.	2017	A Formal System of Reduction Paths (Mathematical Society of Japan)
36.	2016/03	定理証明とモデル検査 (依頼シンポジューム「ビックデータの解析と基盤に関わる科学技術の俯瞰と展開」，電子情報通信学会2016年総合大会)
37.	2016	On upper bound on the Church-Rosser theorem (3rd Workshop on Rewriting Techniques for Program Transformation and Evaluation)
38.	2016	On the Church-Rosser theorem (Mathematical Society of Japan)
39.	2016	Compositional Z: confluence proofs for permutative conversion (JSPS Core-to-Core Program)
40.	2016	Church-Rosser theorem and Compositional Z-property (JSSST (Japan Society for Software Science and Technology))
41.	2015	置換簡約を含むラムダ計算の合流性 (第17回プログラミングおよびプログラミング言語ワークショップ(PPL2015))
42.	2015	Compositional Z: Confluence Proofs for Permutative Conversion (JSSST)
43.	2014	On styles of lambda2-terms (RIMS研究集会「証明論・計算論とその周辺」)
44.	2014	Intermediate lambda-terms between Church and Curry (MSJ)
45.	2013	ラムダ計算の型問題を支配する本質的情報について (日本ソフトウェア科学会)
46.	2013	Decidability for type-related problems of 2nd-order lambda-calculi and negative translations (Computability Theory and Foundation of Mathematics)
47.	2012	ラムダ計算の型問題について (2012年日本数学会年会)
48.	2012	On fine structures between Church-style and Curry-style lambda2-terms (Proof theory and complexity 2012)
49.	2011	The Role of Second-order Quantification in Soft Type Assignment Systems (The 18th Workshop "Types for Proofs and Programs" (TYPES 2011))
50.	2011	On the models of 2nd order intuitionistic propositional logic (MSJ Spring Meeting 2011)
51.	2011	On Duality Between Kripke Models and Lattice Theoretical Models of Second Order Intuitionistic Propositional Logic (Second International Conference on Order, Algebra, and Logics)
52.	2011	On duality between Alexandrov spaces and algebraic completely distributive lattices (日本数学会2011年度秋季総合分科会数学基礎論)
53.	2011	A lattice theoretical description of Sobolev's Kripke models (日本数学会2011年度秋季総合分科会数学基礎論)
54.	2010	The undecidability of type related problems for predicative second-order system in type-free style (Proof Theory)
55.	2009	Type checking and type inference of existential systems (日本数学会2008年度年会数学基礎論および歴史分科会)
56.	2008/03/06	値呼び計算体系のＣＰＳ意味論について (第10回プログラミングおよびプログラミング言語ワークショップ (PPL2008)，日本ソフトウェア科学会)
57.	2007/09	二階直観主義命題論理の埋め込みについて (日本数学会2007年度秋季総合分科会，数学基礎論および歴史分科会)
58.	2006/09	λμ計算の抽象機械 (日本ソフトウェア科学会)
59.	2006/09	An abstract machine for type-free lambda-mu-calculus (MSJ)
60.	2004	ガロア埋め込み：多相型関数と抽象データ型の証明双対性 (日本ソフトウェア科学会)
61.	2001/09	ラムダミュウ計算のモデルについて (日本ソフトウェア科学会第18回大会)