home

George Leibman

Associate Professor

 

Department of Mathematics and Computer Science

Bronx Community College

University Avenue and 181st Street

Bronx, NY 10453

 

1979 B.S. Mathematics, Massachusetts Institute of Technology

1994 M.S. Computer Science, Polytechnic University

2004 Ph.D. Mathematics, CUNY Graduate Center

 

Talks

1.      “Modal Logic of Forcing Classes”, Set Theory Day, CUNY Graduate Center, March 11, 2016

2.      “Maximality Principles for ccc-Forcing”, CUNY Set Theory Seminar, October 26 and November 2, 2007

3.      “A Nonstandard Proof of the Fundamental Theorem of Algebra”, CUNY Graduate Student Logic Seminar, July 2003

4.      “The Unified Modeling Language”,  Featured Talk, Princeton ACM/IEEE Computer Society Joint Meeting, Sarnoff Corporation, January 1999

 

Patents

  1. G. Leibman, J. Stevens and P. Waterhouse, Technique for Locating Electronic Labels in an Electronic Price Display System, U.S. Patent 5,374,815
  2. Tetsunosuke Fujisaki, Joonki Kim, G. Leibman and C. C. Tappert, Improving On-Line Handwriting Recognition using a Prototype Confusability Dialog, U.S.Patent 5,315,667
  3. C. C. Tappert, J. Kim and G. Leibman, Methods and Apparatus for improving prototypes of similar characteristics, U.S. Patent 5,285,505

 

IBM Patent Application Award

 

Publications

  1. C.C.Tappert, T.Chefalas, T.Fujisaki, G.Leibman,  “Optimal recognition of baseline-dependent characters in online handwriting recognition”, IBM Technical Disclosure Bulletin, 1990
  2. C.C.Tappert, G.Leibman,  “A method that eliminates maverick prototypes in online handwriting”, IBM Technical Disclosure Bulletin, 1990
  3. G.Leibman,  “Resolving handwriting recognition confusion by elastic feature extraction”, IBM Technical Disclosure Bulletin, 1991
  4. George Leibman, ”Consistency Strengths of Modified Maximality Principles”, Ph.D. dissertation, CUNY Graduate Center, June 2004
  5. George Leibman, ”A Nonstandard Proof of the Fundamental Theorem of Algebra”, American Mathematical Monthly, v.112, No. 8 (2005)
  6. George Leibman, ”The Consistency Strength of MPccc(R)”, Notre Dame Journal of Formal Logic, v.51, No. 1 (2010)
  7. Joel David Hamkins, George Leibman, and Benedikt Loewe, “Structural Connections Between a Forcing Class and its Modal Logic”, Israel Journal of Mathematics, v. 207, No. 2 (April 2015)